{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:02:12Z","timestamp":1773658932610,"version":"3.50.1"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s12065-025-01123-w","type":"journal-article","created":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T04:48:23Z","timestamp":1766119703000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A decuple crossover scheme in genetic algorithms: a step toward deep evolution"],"prefix":"10.1007","volume":"19","author":[{"given":"Hana","family":"Derouiche","sequence":"first","affiliation":[]},{"given":"Maha","family":"Elarbi","sequence":"additional","affiliation":[]},{"given":"Slim","family":"Bechikh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,19]]},"reference":[{"issue":"7553","key":"1123_CR1","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1038\/nature14544","volume":"521","author":"AE Eiben","year":"2015","unstructured":"Eiben AE, Smith J (2015) From evolutionary computation to the evolution of things. Nature 521(7553):476\u2013482","journal-title":"Nature"},{"key":"1123_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","volume-title":"The Simple Genetic Algorithm: Foundations and Theory","author":"MD Vose","year":"1999","unstructured":"Vose MD (1999) The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge, MA"},{"key":"1123_CR3","doi-asserted-by":"crossref","unstructured":"Eiben AE, Raue P-E, Ruttkay Z (1994) Genetic algorithms with multi-parent recombination. In: International Conference on Parallel Problem Solving from Nature, pp. 78\u201387. Springer","DOI":"10.1007\/3-540-58484-6_252"},{"issue":"102","key":"1123_CR4","first-page":"36","volume":"1989","author":"DE Golberg","year":"1989","unstructured":"Golberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison Wesley 1989(102):36","journal-title":"Addison Wesley"},{"key":"1123_CR5","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111453","volume":"155","author":"B Abdalhaq","year":"2024","unstructured":"Abdalhaq B, Hawash A, Awad A (2024) Diversity enforced genetic algorithm (ga) for binary decision diagram (bdd) reordering. Appl Soft Comput 155:111453","journal-title":"Appl Soft Comput"},{"issue":"7553","key":"1123_CR6","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun Y, Bengio Y, Hinton G (2015) Deep learning. Nature 521(7553):436\u2013444","journal-title":"Nature"},{"key":"1123_CR7","volume":"63","author":"B Cao","year":"2021","unstructured":"Cao B, Zhang W, Wang X, Zhao J, Gu Y, Zhang Y (2021) A memetic algorithm based on two_arch2 for multi-depot heterogeneous-vehicle capacitated arc routing problem. Swarm Evol Comput 63:100864","journal-title":"Swarm Evol Comput"},{"key":"1123_CR8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s12293-015-0166-x","volume":"7","author":"L Feng","year":"2015","unstructured":"Feng L, Ong Y-S, Tan A-H, Tsang IW (2015) Memes as building blocks: a case study on evolutionary optimization+ transfer learning for routing problems. Memetic Computing 7:159\u2013180","journal-title":"Memetic Computing"},{"key":"1123_CR9","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s R, Przewozniczek M, Whitley D, Chicano F (2023) Genetic algorithm with linkage learning. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 981\u2013989","DOI":"10.1145\/3583131.3590349"},{"key":"1123_CR10","doi-asserted-by":"crossref","unstructured":"LaTorre A, Pe\u00f1a JM, Robles V, Muelas S (2008) Using multiple offspring sampling to guide genetic algorithms to solve permutation problems. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 1119\u20131120","DOI":"10.1145\/1389095.1389307"},{"issue":"3","key":"1123_CR11","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1504\/IJCAT.2017.084774","volume":"55","author":"AB Hassanat","year":"2017","unstructured":"Hassanat AB, Alkafaween E (2017) On enhancing genetic algorithms using new crossovers. Int J Comput Appl Technol 55(3):202\u2013212","journal-title":"Int J Comput Appl Technol"},{"issue":"3","key":"1123_CR12","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.ejor.2023.07.022","volume":"314","author":"P Pop","year":"2024","unstructured":"Pop P, Cosma O, Sabo C, Sitar C (2024) A comprehensive survey on the generalized traveling salesman problem. Eur J Oper Res 314(3):819\u2013835","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1123_CR13","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The vehicle routing problem: An overview of exact and approximate algorithms. Eur J Oper Res 59(3):345\u2013358","journal-title":"Eur J Oper Res"},{"issue":"14","key":"1123_CR14","doi-asserted-by":"crossref","first-page":"1955","DOI":"10.1049\/iet-its.2020.0289","volume":"14","author":"C Ma","year":"2020","unstructured":"Ma C, Liu P, Xu X (2020) Vehicles robust scheduling of hazardous materials based on hybrid particle swarm optimisation and genetic algorithm. IET Intel Transport Syst 14(14):1955\u20131966","journal-title":"IET Intel Transport Syst"},{"key":"1123_CR15","unstructured":"Goldberg DE, Lingle R (2014) Alleles, loci, and the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 154\u2013159. Psychology Press"},{"key":"1123_CR16","unstructured":"Davis L (2014) Job shop scheduling with genetic algorithms. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 136\u2013140. Psychology Press"},{"key":"1123_CR17","unstructured":"Oliver I, Smith D, Holland JR (1987) A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic Algorithms and Their Application, pp. 224\u2013230"},{"issue":"3","key":"1123_CR18","doi-asserted-by":"crossref","first-page":"1879","DOI":"10.1016\/j.eswa.2009.07.082","volume":"37","author":"C-K Ting","year":"2010","unstructured":"Ting C-K, Su C-H, Lee C-N (2010) Multi-parent extension of partially mapped crossover for combinatorial optimization problems. Expert Syst Appl 37(3):1879\u20131886","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1123_CR19","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1002\/cmm4.1122","volume":"2","author":"Z Iqbal","year":"2020","unstructured":"Iqbal Z, Bashir N, Hussain A, Cheema SA (2020) A novel completely mapped crossover operator for genetic algorithm to facilitate the traveling salesman problem. Comput Math Methods 2(6):1122","journal-title":"Comput Math Methods"},{"key":"1123_CR20","doi-asserted-by":"crossref","unstructured":"Li K, Xu F, Huang P, Zhang W (2009) A new best-worst ant system with heuristic crossover operator for solving tsp. In: 2009 Fifth International Conference on Natural Computation, vol. 4, pp. 92\u201397. IEEE","DOI":"10.1109\/ICNC.2009.109"},{"key":"1123_CR21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.cie.2019.05.012","volume":"133","author":"A Arram","year":"2019","unstructured":"Arram A, Ayob M (2019) A novel multi-parent order crossover in genetic algorithm for combinatorial optimization problems. Compact Ind Eng 133:267\u2013274","journal-title":"Compact Ind Eng"},{"key":"1123_CR22","doi-asserted-by":"crossref","unstructured":"Grefenstette J, Gopal R, Rosmaita B, Van\u00a0Gucht D (2014) Genetic algorithms for the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 160\u2013168. Psychology Press","DOI":"10.4324\/9781315799674"},{"issue":"6","key":"1123_CR23","first-page":"96","volume":"3","author":"ZH Ahmed","year":"2010","unstructured":"Ahmed ZH (2010) Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int J Biom Bioinform (IJBB) 3(6):96","journal-title":"Int J Biom Bioinform (IJBB)"},{"key":"1123_CR24","doi-asserted-by":"crossref","unstructured":"Kang S, Kim S-S, Won J-H, Kang Y-M (2015) Bidirectional constructive crossover for evolutionary approach to travelling salesman problem. In: 2015 5th International Conference on IT Convergence and Security (ICITCS), pp. 1\u20134. IEEE","DOI":"10.1109\/ICITCS.2015.7292958"},{"issue":"15","key":"1123_CR25","doi-asserted-by":"crossref","first-page":"98","DOI":"10.4236\/jcc.2016.415009","volume":"4","author":"BL Lin","year":"2016","unstructured":"Lin BL, Sun X, Salous S (2016) Solving travelling salesman problem with an improved hybrid genetic algorithm. J Comput Commun 4(15):98\u2013106","journal-title":"J Comput Commun"},{"issue":"3","key":"1123_CR26","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/10798587.2000.10642829","volume":"8","author":"G \u00dc\u00e7oluk","year":"2002","unstructured":"\u00dc\u00e7oluk G (2002) Genetic algorithm solution of the tsp avoiding special crossover and mutation. Intell Autom Soft Comput 8(3):265\u2013272","journal-title":"Intell Autom Soft Comput"},{"key":"1123_CR27","doi-asserted-by":"crossref","unstructured":"Uray M, Wintersteller S, Huber S (2023) Csrx: A novel crossover operator for a genetic algorithm applied to the traveling salesperson problem. In: International Data Science Conference, pp. 21\u201327. Springer","DOI":"10.1007\/978-3-031-42171-6_3"},{"key":"1123_CR28","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24:17\u201330","journal-title":"Appl Intell"},{"key":"1123_CR29","unstructured":"Honglin Y, Jijun Y (2010) An Improved Genetic Algorithm for the Vehicle Routing Problem"},{"key":"1123_CR30","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2298\/CSIS100425067K","volume":"21","author":"J Kratica","year":"2012","unstructured":"Kratica J, Kosti\u0107 T, To\u0161i\u0107 D, Dugo\u0161ija D, Filipovi\u0107 V (2012) A genetic algorithm for the routing and carrier selection problem. Comput Sci Inf Syst 21:49\u201362","journal-title":"Comput Sci Inf Syst"},{"issue":"3","key":"1123_CR31","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.cie.2011.11.025","volume":"62","author":"AS Tasan","year":"2012","unstructured":"Tasan AS, Gen M (2012) A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Comput Ind Eng 62(3):755\u2013761","journal-title":"Comput Ind Eng"},{"issue":"26","key":"1123_CR32","first-page":"34","volume":"69","author":"P Chand","year":"2013","unstructured":"Chand P, Mohanty J (2013) Solving vehicle routing problem with proposed non-dominated sorting genetic algorithm and comparison with classical evolutionary algorithms. Int J Comput Appl 69(26):34\u201341","journal-title":"Int J Comput Appl"},{"issue":"2","key":"1123_CR33","first-page":"359","volume":"18","author":"K Pulji\u0107","year":"2013","unstructured":"Pulji\u0107 K, Manger R (2013) Comparison of eight evolutionary crossover operators for the vehicle routing problem. Math Commun 18(2):359\u2013375","journal-title":"Math Commun"},{"issue":"1","key":"1123_CR34","volume":"2013","author":"W Zhou","year":"2013","unstructured":"Zhou W, Song T, He F, Liu X (2013) Multiobjective vehicle routing problem with route balance based on genetic algorithm. Discret Dyn Nat Soc 2013(1):325686","journal-title":"Discret Dyn Nat Soc"},{"key":"1123_CR35","volume-title":"Introduction to Operations Research","author":"FS Hillier","year":"2015","unstructured":"Hillier FS, Lieberman GJ (2015) Introduction to Operations Research. McGraw-Hill, New York, NY"},{"key":"1123_CR36","doi-asserted-by":"crossref","unstructured":"Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of Genetic Algorithms vol. 1, pp. 69\u201393. Elsevier, San Mateo, CA","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"issue":"1","key":"1123_CR37","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10462-021-10042-y","volume":"55","author":"Z-H Zhan","year":"2022","unstructured":"Zhan Z-H, Shi L, Tan KC, Zhang J (2022) A survey on evolutionary computation for complex continuous optimization. Artif Intell Rev 55(1):59\u2013110","journal-title":"Artif Intell Rev"},{"key":"1123_CR38","volume":"107","author":"Y Wang","year":"2021","unstructured":"Wang Y, Han Z (2021) Ant colony optimization for traveling salesman problem based on parameters optimization. Appl Soft Comput 107:107439","journal-title":"Appl Soft Comput"},{"issue":"4","key":"1123_CR39","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) Tsplib-a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"issue":"14","key":"1123_CR40","doi-asserted-by":"crossref","first-page":"3221","DOI":"10.3390\/math11143221","volume":"11","author":"J Xu","year":"2023","unstructured":"Xu J, Hu W, Gu W, Yu Y (2023) A discrete jaya algorithm based on reinforcement learning and simulated annealing for the traveling salesman problem. Mathematics 11(14):3221","journal-title":"Mathematics"},{"issue":"1","key":"1123_CR41","doi-asserted-by":"crossref","first-page":"44","DOI":"10.3390\/a16010044","volume":"16","author":"C Cariou","year":"2023","unstructured":"Cariou C, Moiroux-Arvis L, Pinet F, Chanet J-P (2023) Evolutionary algorithm with geometrical heuristics for solving the close enough traveling salesman problem: Application to the trajectory planning of an unmanned aerial vehicle. Algorithms 16(1):44","journal-title":"Algorithms"},{"key":"1123_CR42","unstructured":"Ross PJ (1988) Taguchi techniques for quality engineering: loss function, orthogonal experiments, parameter and tolerance design"},{"key":"1123_CR43","volume":"153","author":"Z Lei","year":"2024","unstructured":"Lei Z, Hao J-K (2024) An effective memetic algorithm for the close-enough traveling salesman problem. Appl Soft Comput 153:111266","journal-title":"Appl Soft Comput"},{"key":"1123_CR44","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100665","volume":"54","author":"J Carrasco","year":"2020","unstructured":"Carrasco J, Garc\u00eda S, Rueda M, Das S, Herrera F (2020) Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: Practical guidelines and a critical review. Swarm Evol Comput 54:100665","journal-title":"Swarm Evol Comput"},{"key":"1123_CR45","doi-asserted-by":"crossref","DOI":"10.1201\/9781420036268","volume-title":"Handbook of Parametric and Nonparametric Statistical Procedures","author":"DJ Sheskin","year":"2003","unstructured":"Sheskin DJ (2003) Handbook of Parametric and Nonparametric Statistical Procedures. Chapman and hall\/CRC, Boca Raton, FL"},{"issue":"1","key":"1123_CR46","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"key":"1123_CR47","unstructured":"Benavoli A, Corani G, Dem\u0161ar J, Zaffalon, M v.n.p.y. journal=Journal of Machine Learning Research: Time for a change: a tutorial for comparing multiple classifiers through bayesian analysis"},{"issue":"2","key":"1123_CR48","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1093\/genetics\/147.2.879","volume":"147","author":"SP Otto","year":"1997","unstructured":"Otto SP, Barton NH (1997) The evolution of recombination: removing the limits to natural selection. Genetics 147(2):879\u2013906","journal-title":"Genetics"},{"key":"1123_CR49","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2015","unstructured":"Eiben AE, Smith JE (2015) Introduction to Evolutionary Computing. Springer, Berlin, Heidelberg"},{"issue":"2","key":"1123_CR50","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal RB et al (1995) Simulated binary crossover for continuous search space. Complex Syst 9(2):115\u2013148","journal-title":"Complex Syst"},{"key":"1123_CR51","doi-asserted-by":"crossref","first-page":"137902","DOI":"10.1109\/ACCESS.2021.3117987","volume":"9","author":"S Rimcharoen","year":"2021","unstructured":"Rimcharoen S, Leelathakul N (2021) Ring-based crossovers in genetic algorithms: Characteristic decomposition and their generalization. IEEE Access 9:137902\u2013137922","journal-title":"IEEE Access"},{"key":"1123_CR52","unstructured":"Dorronsoro B (2025) Vehicle Routing Problem Resources. Accessed: 2025-06-03. https:\/\/www.bernabe.dorronsoro.es\/vrp\/"},{"key":"1123_CR53","unstructured":"Christofides N (1979) The vehicle routing problem. Combinatorial optimization"},{"key":"1123_CR54","doi-asserted-by":"crossref","unstructured":"Golden BL, Wasil EA, Kelly JP, Chao I-M (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Fleet Management and Logistics, pp. 33\u201356. Springer, ???","DOI":"10.1007\/978-1-4615-5755-5_2"},{"key":"1123_CR55","unstructured":"CVRPLIB (2025) Capacitated Vehicle Routing Problem Library. Accessed: 2025-06-06. http:\/\/vrp.galgos.inf.puc-rio.br\/index.php\/en\/"},{"issue":"3","key":"1123_CR56","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1007\/s12065-023-00826-2","volume":"17","author":"E Naderi","year":"2024","unstructured":"Naderi E, Mirzaei L, Pourakbari-Kasmaei M, Cerna FV, Lehtonen M (2024) Optimization of active power dispatch considering unified power flow controller: application of evolutionary algorithms in a fuzzy framework. Evol Intel 17(3):1357\u20131387","journal-title":"Evol Intel"},{"issue":"5","key":"1123_CR57","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1080\/15325008.2023.2234378","volume":"52","author":"E Naderi","year":"2024","unstructured":"Naderi E, Mirzaei L, Trimble JP, Cantrell DA (2024) Multi-objective optimal power flow incorporating flexible alternating current transmission systems: Application of a wavelet-oriented evolutionary algorithm. Electri Power Compon Syst 52(5):766\u2013795","journal-title":"Electri Power Compon Syst"},{"key":"1123_CR58","doi-asserted-by":"crossref","DOI":"10.1017\/9781108980647","volume-title":"Engineering Design Optimization","author":"JR Martins","year":"2021","unstructured":"Martins JR, Ning A (2021) Engineering Design Optimization. Cambridge University Press, Cambridge"},{"issue":"3","key":"1123_CR59","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.3390\/app12031186","volume":"12","author":"ID Raji","year":"2022","unstructured":"Raji ID, Bello-Salau H, Umoh IJ, Onumanyi AJ, Adegboye MA, Salawudeen AT (2022) Simple deterministic selection-based genetic algorithm for hyperparameter tuning of machine learning models. Appl Sci 12(3):1186","journal-title":"Appl Sci"},{"issue":"1","key":"1123_CR60","first-page":"5246309","volume":"2022","author":"H Li","year":"2022","unstructured":"Li H, Shi N (2022) Application of genetic optimization algorithm in financial portfolio problem. Comput Intell Neurosci 2022(1):5246309","journal-title":"Comput Intell Neurosci"},{"key":"1123_CR61","volume":"162","author":"Z Li","year":"2024","unstructured":"Li Z, Rong H, Yang S, Yang X, Huang Y (2024) A dual-population coevolutionary algorithm for balancing convergence and diversity in the decision space in multimodal multi-objective optimization. Appl Soft Comput 162:111770","journal-title":"Appl Soft Comput"},{"key":"1123_CR62","doi-asserted-by":"crossref","unstructured":"Opris A (2025) A many-objective problem where crossover is provably indispensable. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 39, pp. 27108\u201327116","DOI":"10.1609\/aaai.v39i25.34918"},{"key":"1123_CR63","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105731","volume":"142","author":"H Xiong","year":"2022","unstructured":"Xiong H, Shi S, Ren D, Hu J (2022) A survey of job shop scheduling problem: The types and models. Comput Oper Res 142:105731","journal-title":"Comput Oper Res"},{"key":"1123_CR64","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen HI, Khan A, Pokutta S, Tetali P (2017) Approximation and online algorithms for multidimensional bin packing: A survey. Comput Sci Rev 24:63\u201379","journal-title":"Comput Sci Rev"},{"issue":"4","key":"1123_CR65","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"2002","unstructured":"Zitzler E, Thiele L (2002) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1123_CR66","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian Y, Cheng R, Zhang X, Jin Y (2017) Platemo: A matlab platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"issue":"2","key":"1123_CR67","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1123_CR68","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s12293-021-00344-7","volume":"13","author":"J Yuan","year":"2021","unstructured":"Yuan J, Li Y (2021) Solving binary multi-objective knapsack problems with novel greedy strategy. Memetic Computing 13(4):447\u2013458","journal-title":"Memetic Computing"},{"key":"1123_CR69","doi-asserted-by":"crossref","unstructured":"Peerlinck A, Sheppard J (2022) Multi-objective factored evolutionary optimization and the multi-objective knapsack problem. In: 2022 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE","DOI":"10.1109\/CEC55065.2022.9870377"},{"key":"1123_CR70","unstructured":"R\u00edo JE, Mavris DN (2024) Hypervolume-based multi-objective expected improvement exact evaluation for three-objective functions. In: AIAA SCITECH 2024 Forum, p. 1801"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01123-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-025-01123-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01123-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:08:35Z","timestamp":1773655715000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-025-01123-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,19]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1123"],"URL":"https:\/\/doi.org\/10.1007\/s12065-025-01123-w","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,19]]},"assertion":[{"value":"22 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"9"}}