{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T00:20:48Z","timestamp":1759537248877,"version":"build-2065373602"},"reference-count":45,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["#312367\/2022-8","#311159\/2023-0"],"award-info":[{"award-number":["#312367\/2022-8","#311159\/2023-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["www.mdpi.com"],"crossmark-restriction":true},"short-container-title":["Algorithms"],"abstract":"<jats:p>Evolutionary Algorithms (EAs) are those based on the phenomenon of survival of the fittest. Differential Evolution (DE) is a member of this family, and it is well-suited for handling problems with real-valued variables. However, to use DE to solve binary problems, it is necessary to employ some adaptation. The primary objective of the present study is to develop a new binary version of DE. The proposed algorithm is called Binary Differential Evolution with a limited maximum number of dimension changes (NBDE), and it was tested with the OneMax Problem, five variants of the Knapsack Problem (KP), and Feature Selection (FS). The results showed that NBDE is competitive and superior to the other tested algorithms in many instances. For the 0\/1 KP and 0\/1 Multidimensional KP, NBDE outperforms all the other algorithms for all instances. For the FS problem, the proposed algorithm demonstrates good accuracy as its primary quality. The proposed algorithm exhibits a satisfactory performance, particularly in high-dimensional problems, which appears to be a quality inherited from the method that inspired its creation. This is particularly interesting because it provides empirical evidence that the importation of operators can perpetuate a pattern of behavior in algorithms with different structures.<\/jats:p>","DOI":"10.3390\/a18100621","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T09:37:21Z","timestamp":1759311441000},"page":"621","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Binary Differential Evolution with a Limited Maximum Number of Dimension Changes"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7510-0511","authenticated-orcid":false,"given":"Jade","family":"Filgueira","sequence":"first","affiliation":[{"name":"Production Engineering Academic Department, Federal University of Technology-Parana, Ponta Grossa 84017-220, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2950-7377","authenticated-orcid":false,"given":"Thiago","family":"Antonini Alves","sequence":"additional","affiliation":[{"name":"Production Engineering Academic Department, Federal University of Technology-Parana, Ponta Grossa 84017-220, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7869-7184","authenticated-orcid":false,"given":"Clodomir","family":"Santana","sequence":"additional","affiliation":[{"name":"Department of Internal Medicine, University of California, Davis, CA 95817, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2488-6080","authenticated-orcid":false,"given":"Attilio","family":"Converti","sequence":"additional","affiliation":[{"name":"Department of Civil, Chemical and Environmental Engineering, University of Genoa, Pole of Chemical Engineering, 16145 Genoa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0924-5341","authenticated-orcid":false,"given":"Carmelo J. A.","family":"Bastos-Filho","sequence":"additional","affiliation":[{"name":"Pernambuco Polytechnic School, University of Pernambuco, Recife 50720-001, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1278-4602","authenticated-orcid":false,"given":"Hugo","family":"Siqueira","sequence":"additional","affiliation":[{"name":"Production Engineering Academic Department, Federal University of Technology-Parana, Ponta Grossa 84017-220, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., and Smith, J.E. (2015). Introduction to Evolutionary Computing, Springer. [2nd ed.].","DOI":"10.1007\/978-3-662-44874-8"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution\u2014A simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ins.2020.07.013","article-title":"Novel binary differential evolution algorithm for knapsack problems","volume":"542","author":"Ali","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_4","unstructured":"He, X., and Han, L. (2007, January 25\u201328). A novel binary differential evolution algorithm based on artificial immune system. Proceedings of the IEEE Congress on Evolutionary Computation, Singapore."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","article-title":"A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems","volume":"37","author":"Wang","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Fan, G.-M., and Huang, H.-J. (2017, January 3\u20136). A novel binary differential evolution algorithm for a class of fuzzy-stochastic resource allocation problems. Proceedings of the 13th IEEE International Conference on Control & Automation, Ohrid, North Macedonia.","DOI":"10.1109\/ICCA.2017.8003119"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"24843","DOI":"10.1109\/ACCESS.2019.2899035","article-title":"Fast minimization of fixed polarity Reed-Muller expressions","volume":"7","author":"He","year":"2019","journal-title":"IEEE Access"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"101022","DOI":"10.1016\/j.swevo.2021.101022","article-title":"Novel binary differential evolution algorithm based on taper-shaped transfer functions for binary optimization problems","volume":"69","author":"He","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/j.ins.2022.12.117","article-title":"Feature selection using diversity-based multi-objective binary differential evolution","volume":"626","author":"Wang","year":"2023","journal-title":"Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.future.2019.03.032","article-title":"A novel binary artificial bee colony algorithm","volume":"98","author":"Santana","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wu, C.Y., and Tseng, K.Y. (2010, January 28\u201331). Engineering optimization using modified binary differential evolution algorithm. Proceedings of the 3rd International Joint Conference on Computational Sciences and Optimization (CSO 2010), Huangshan, China.","DOI":"10.1109\/CSO.2010.185"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Wang, X., and Guo, P. (2012, January 29\u201331). A novel binary adaptive differential evolution algorithm for Bayesian network learning. Proceedings of the 8th International Conference on Natural Computation, Chongqing, China.","DOI":"10.1109\/ICNC.2012.6234744"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Li, H., and Zhang, L. (2015, January 19\u201320). Solving linear bilevel programming problems using a binary differential evolution. Proceedings of the 11th International Conference on Computational Intelligence and Security, Shenzhen, China.","DOI":"10.1109\/CIS.2015.18"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.ins.2016.05.037","article-title":"A self-adaptive binary differential evolution algorithm for large scale binary optimization problems","volume":"367\u2013368","author":"Banitalebi","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Xuan, M., Li, L., Lin, Q., Ming, Z., and Wei, W. (2021, January 26\u201327). A modified decomposition-based multi-objective optimization algorithm for high dimensional feature selection. Proceedings of the 7th IEEE International Conference on Cloud Computing and Intelligence Systems, Beijing, China.","DOI":"10.1109\/CCIS53392.2021.9754686"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"110360","DOI":"10.1016\/j.asoc.2023.110360","article-title":"Multiobjective optimization algorithm with dynamic operator selection for feature selection in high-dimensional classification","volume":"143","author":"Wei","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Deng, C.S., Zhao, B.Y., Deng, A.Y., and Liang, C.Y. (2008, January 12\u201314). Hybrid-coding binary differential evolution algorithm with application to 0\u20131 knapsack problems. Proceedings of the International Conference on Computer Science and Software Engineering (CSSE), Wuhan, China.","DOI":"10.1109\/CSSE.2008.813"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Xie, W., Chi, Y., Wang, L., Yu, K., and Li, W. (2021, January 9\u201312). MMBDE: A two-stage hybrid feature selection method from microarray data. Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, Houston, TX, USA.","DOI":"10.1109\/BIBM52615.2021.9669496"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"He, X., Zhang, Q., Sun, N., and Dong, Y. (2009, January 7\u20138). Feature selection with discrete binary differential evolution. Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence (AICI), Shanghai, China.","DOI":"10.1109\/AICI.2009.438"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Krause, J., and Lopes, H.S. (2013, January 8\u201311). A comparison of differential evolution algorithm with binary and continuous encoding for the MKP. Proceedings of the BRICS Congress on Computational Intelligence and Brazilian Congress on Computational Intelligence (BRICS-CCI-CBIC), Ipojuca, Brazil.","DOI":"10.1109\/BRICS-CCI-CBIC.2013.70"},{"key":"ref_21","unstructured":"Pampar\u00e1, G., Engelbrecht, A.P., and Franken, N. (2006, January 16\u201321). Binary differential evolution. Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Canada."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Engelbrecht, A.P., and Pampar\u00e1, G. (2007, January 25\u201328). Binary differential evolution strategies. Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Singapore.","DOI":"10.1109\/CEC.2007.4424711"},{"key":"ref_23","unstructured":"Kennedy, J., and Eberhart, R.C. (1997, January 12\u201315). A discrete binary version of the particle swarm algorithm. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC), Orlando, FL, USA."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Parija, S.R., Sahu, P.K., and Singh, S.S. (2014, January 22\u201324). Differential evolution for cost reduction in cellular network. Proceedings of the International Conference on High Performance Computing and Applications (ICHPCA), Bhubaneswar, India.","DOI":"10.1109\/ICHPCA.2014.7045313"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Dhaliwal, J.S., and Dhillon, J.S. (2018, January 20\u201322). A binary differential evolution based memetic algorithm to solve profit based unit commitment problem. Proceedings of the Power India International Conference (PIICON), Kurukshetra, India.","DOI":"10.1109\/POWERI.2018.8704369"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"118811","DOI":"10.1016\/j.eswa.2022.118811","article-title":"Superpixel-based multiobjective change detection based on self-adaptive neighborhood-based binary differential evolution","volume":"212","author":"Gao","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Bidgoli, A.A., Ebrahimpour-Komleh, H., and Rahnamayan, S. (2019, January 10\u201313). A novel multi-objective binary differential evolution algorithm for multi-label feature selection. Proceedings of the IEEE Congress on Evolutionary Computation, Wellington, New Zealand.","DOI":"10.1109\/CEC.2019.8790287"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"24109","DOI":"10.1109\/ACCESS.2019.2900078","article-title":"Binary differential evolution based on individual entropy for feature subset optimization","volume":"7","author":"Li","year":"2019","journal-title":"IEEE Access"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"104393","DOI":"10.1016\/j.chemolab.2021.104393","article-title":"Near infrared feature waveband selection for fishmeal quality assessment by frequency adaptive binary differential evolution","volume":"217","author":"Zhang","year":"2021","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1016\/j.neucom.2014.07.030","article-title":"A binary differential evolution algorithm learning from explored solutions","volume":"149","author":"Chen","year":"2015","journal-title":"Neurocomputing"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhang, L., and Li, H. (2017, January 15\u201317). BPSOBDE: A binary version of hybrid heuristic algorithm for multidimensional knapsack problems. Proceedings of the 13th International Conference on Computational Intelligence and Security, Hong Kong, China.","DOI":"10.1109\/CIS.2017.00020"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Pampara, G., and Engelbrecht, A.P. (2011, January 11\u201315). Binary artificial bee colony optimization. Proceedings of the IEEE Symposium on Swarm Intelligence, Paris, France.","DOI":"10.1109\/SIS.2011.5952562"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","article-title":"Genetic algorithms","volume":"267","author":"Holland","year":"1992","journal-title":"Sci. Am."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Ackley, D.H. (1987). A Connectionist Machine for Genetic Hillclimbing, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4613-1997-9"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"111934","DOI":"10.1016\/j.asoc.2024.111934","article-title":"Finding and exploring promising search space for the 0\u20131 multidimensional knapsack problem","volume":"164","author":"Xu","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1016\/j.ejor.2018.10.043","article-title":"Mathematical models and decomposition methods for the multiple knapsack problem","volume":"274","author":"Delorme","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"ref_37","first-page":"215","article-title":"Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems","volume":"123","author":"Lai","year":"1993","journal-title":"Theor. Comput. Sci."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.evalprogplan.2009.06.007","article-title":"Multiple choice knapsack problem: Example of planning choice in transportation","volume":"33","author":"Zhong","year":"2010","journal-title":"Eval. Program Plann."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"109469","DOI":"10.1016\/j.ijar.2025.109469","article-title":"A novel multi-label feature selection method based on conditional entropy and its acceleration mechanism","volume":"185","author":"Liao","year":"2025","journal-title":"Int. J. Approx. Reason."},{"key":"ref_40","unstructured":"Google OR-Tools (2025, July 16). Linear Solver Wrapper (CBC). Available online: https:\/\/developers.google.com\/optimization\/reference\/python\/linear_solver\/pywraplp."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TSMCC.2002.1009128","article-title":"Statistical analysis of the main parameters involved in the design of a genetic algorithm","volume":"32","author":"Rojas","year":"2002","journal-title":"IEEE Trans. Syst. Man Cybern.\u2014Part C Appl. Rev."},{"key":"ref_42","unstructured":"Weisberg, S. (2014). Applied Linear Regression, Wiley. [4th ed.]."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Giannelos, S., Zhang, T., Pudjianto, D., Konstantelos, I., and Strbac, G. (2024). Investments in electricity distribution grids: Strategic versus incremental planning. Energies, 17.","DOI":"10.3390\/en17112724"},{"key":"ref_44","first-page":"222","article-title":"Echo State Networks for Seasonal Streamflow Series Forecasting","volume":"Volume 7435","author":"Yin","year":"2012","journal-title":"Intelligent Data Engineering and Automated Learning\u2014IDEAL 2012. Lecture Notes in Computer Science"},{"key":"ref_45","unstructured":"Castanho, M.J.P., Lima, D.S., Veiga, L.M.S., Filho, M.C.F., Neto, E.A.B., and Silva, I.N. (2022). Performance Evaluation of Bio-Inspired Algorithms in the Calibration of Linear Models for SoC Estimation in Li-Ion Batteries. Algorithms, 15."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/10\/621\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T04:11:29Z","timestamp":1759464689000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/10\/621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"references-count":45,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["a18100621"],"URL":"https:\/\/doi.org\/10.3390\/a18100621","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2025,10,1]]}}}