{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T07:11:37Z","timestamp":1742195497971,"version":"3.38.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00500-025-10525-y","type":"journal-article","created":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T18:18:37Z","timestamp":1741025917000},"page":"1967-1980","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complex preference analysis: a score-based evaluation strategy for ranking and comparison of the evolutionary algorithms"],"prefix":"10.1007","volume":"29","author":[{"given":"Debojyoti","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,3]]},"reference":[{"issue":"1","key":"10525_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1993.1.1.1","volume":"1","author":"T B\u00e4ck","year":"1993","unstructured":"B\u00e4ck T, Schwefel HP (1993) An overview of evolutionary algorithms for parameter optimization. Evol Comput 1(1):1\u201323","journal-title":"Evol Comput"},{"issue":"1","key":"10525_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1214\/ss\/1177011077","volume":"8","author":"D Bertsimas","year":"1993","unstructured":"Bertsimas D, Tsitsiklis J (1993) Simulated annealing. Stat Sci 8(1):10\u201315","journal-title":"Stat Sci"},{"key":"10525_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ins.2017.02.050","volume":"396","author":"A Biswas","year":"2017","unstructured":"Biswas A, Biswas B (2017) Analyzing evolutionary optimization and community detection algorithms using regression line dominance. Inf Sci 396:185\u2013201","journal-title":"Inf Sci"},{"key":"10525_CR4","doi-asserted-by":"crossref","unstructured":"Carrano EG, Takahashi RH, Wanner EF (2008) An enhanced statistical approach for evolutionary algorithm comparison. In: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pp 897\u2013904","DOI":"10.1145\/1389095.1389270"},{"key":"10525_CR5","volume":"1","author":"A Cutolo","year":"2012","unstructured":"Cutolo A, De Nicola C, Manzo R et al (2012) (2012) Optimal paths on urban networks using travelling times prevision. Modelling and Simulation in Engineering 1:564168","journal-title":"Modelling and Simulation in Engineering"},{"issue":"4","key":"10525_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/TEVC.2004.831262","volume":"8","author":"A Czarn","year":"2004","unstructured":"Czarn A, MacNish C, Vijayan K et al (2004) Statistical exploratory analysis of genetic algorithms. IEEE Trans Evol Comput 8(4):405\u2013421","journal-title":"IEEE Trans Evol Comput"},{"key":"10525_CR7","doi-asserted-by":"crossref","unstructured":"Deng Y, Liu Y, Zhou D, et\u00a0al (2015) An improved genetic algorithm with initial population strategy for symmetric tsp. Mathematical problems in engineering 2015","DOI":"10.1155\/2015\/212794"},{"issue":"1","key":"10525_CR8","doi-asserted-by":"publisher","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 et al (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":"10525_CR9","doi-asserted-by":"publisher","first-page":"134","DOI":"10.20535\/SRIT.2308-8893.2024.1.10","volume":"1","author":"A El Ouissari","year":"2024","unstructured":"El Ouissari A, El Moutaouakil K (2024) Intelligent optimal control of nonlinear diabetic population dynamics system using a genetic algorithm. System research and information technologies 1:134\u2013148","journal-title":"System research and information technologies"},{"key":"10525_CR10","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M et al (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the cec\u20192005 special session on real parameter optimization. Journal of Heuristics 15:617\u2013644","journal-title":"Journal of Heuristics"},{"key":"10525_CR11","unstructured":"Gavish B, Graves SC (1978) The travelling salesman problem and related problems"},{"issue":"4","key":"10525_CR12","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search: A tutorial. Interfaces 20(4):74\u201394","journal-title":"Interfaces"},{"issue":"1","key":"10525_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He J, Yao X (2001) Drift analysis and average time complexity of evolutionary algorithms. Artif Intell 127(1):57\u201385","journal-title":"Artif Intell"},{"issue":"5","key":"10525_CR14","doi-asserted-by":"publisher","first-page":"404","DOI":"10.7763\/IJIET.2011.V1.67","volume":"1","author":"ZCSS Hlaing","year":"2011","unstructured":"Hlaing ZCSS, Khine MA (2011) Solving traveling salesman problem by using improved ant colony optimization algorithm. International Journal of Information and Education Technology 1(5):404","journal-title":"International Journal of Information and Education Technology"},{"issue":"8","key":"10525_CR15","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/0305-0548(94)90016-7","volume":"21","author":"J Knox","year":"1994","unstructured":"Knox J (1994) Tabu search performance on the symmetric traveling salesman problem. Computers & Operations Research 21(8):867\u2013876","journal-title":"Computers & Operations Research"},{"key":"10525_CR16","doi-asserted-by":"crossref","unstructured":"Mersmann O, Preuss M, Trautmann H (2010) Benchmarking evolutionary algorithms: Towards exploratory landscape analysis. In: Parallel Problem Solving from Nature, PPSN XI: 11th International Conference, Krak\u00f3w, Poland, September 11-15, 2010, Proceedings, Part I 11, Springer, pp 73\u201382","DOI":"10.1007\/978-3-642-15844-5_8"},{"key":"10525_CR17","first-page":"43","volume-title":"Genetic algorithm","author":"S Mirjalili","year":"2019","unstructured":"Mirjalili S, Mirjalili S (2019) Genetic algorithm. Theory and Applications, Evolutionary Algorithms and Neural Networks, pp 43\u201355"},{"key":"10525_CR18","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"10525_CR19","unstructured":"Moreno-P\u00e9rez J, Campos-Rodr\u00edguez C, Laguna M (2007) On the comparison of metaheuristics through non-parametric statistical techniques. In: Proceedings of the Spanish Congress on Metaheuristics, Evolutionary and Bioinspired Algorithms (MAEB\u20192007), pp 286\u2013293"},{"issue":"4","key":"10525_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.5267\/j.jfs.2022.10.003","volume":"2","author":"S Mousavi","year":"2022","unstructured":"Mousavi S, Mirinezhad S (2022) Weevil damage optimization algorithm and its applications. Journal of Future Sustainability 2(4):133\u2013144","journal-title":"Journal of Future Sustainability"},{"key":"10525_CR21","doi-asserted-by":"crossref","unstructured":"Ngatchou P, Zarei A, El-Sharkawi A (2005) Pareto multi objective optimization. In: Proceedings of the 13th international conference on, intelligent systems application to power systems, IEEE, pp 84\u201391","DOI":"10.1109\/ISAP.2005.1599245"},{"issue":"1","key":"10525_CR22","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TEVC.2002.806169","volume":"7","author":"S Nijssen","year":"2003","unstructured":"Nijssen S, Back T (2003) An analysis of the behavior of simplified evolutionary algorithms on trap functions. IEEE Trans Evol Comput 7(1):11\u201322","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"10525_CR23","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1177\/1059712309103566","volume":"17","author":"I Paenke","year":"2009","unstructured":"Paenke I, Jin Y, Branke J (2009) Balancing population-and individual-level adaptation in changing environments. Adapt Behav 17(2):153\u2013174","journal-title":"Adapt Behav"},{"key":"10525_CR24","unstructured":"Papadimitriou CH (2003) Computational complexity. In: Encyclopedia of computer science. p 260\u2013265"},{"key":"10525_CR25","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"JY Potvin","year":"1996","unstructured":"Potvin JY (1996) Genetic algorithms for the traveling salesman problem. Ann Oper Res 63:337\u2013370","journal-title":"Ann Oper Res"},{"issue":"3","key":"10525_CR26","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao RV, Savsani VJ, Vakharia D (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303\u2013315","journal-title":"Comput Aided Des"},{"key":"10525_CR27","first-page":"107","volume-title":"Optimization in Artificial Intelligence and Data Sciences: ODS, First Hybrid Conference, Rome, Italy, September 14\u201317","author":"L Rarit\u00e0","year":"2021","unstructured":"Rarit\u00e0 L (2021) (2022) A genetic algorithm to optimize dynamics of supply chains. Optimization in Artificial Intelligence and Data Sciences: ODS, First Hybrid Conference, Rome, Italy, September 14\u201317. Springer, pp 107\u2013115"},{"issue":"4","key":"10525_CR28","doi-asserted-by":"publisher","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"},{"key":"10525_CR29","doi-asserted-by":"crossref","unstructured":"Rojas I, Gonz\u00e1lez J, Pomares H, et\u00a0al (2002) Statistical analysis of the main parameters involved in the design of a genetic algorithm. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) 32(1):31\u201337","DOI":"10.1109\/TSMCC.2002.1009128"},{"issue":"4148","key":"10525_CR30","first-page":"688","volume":"163","author":"EH Simpson","year":"1949","unstructured":"Simpson EH (1949) Measurement of diversity. nature 163(4148):688\u2013688","journal-title":"Measurement of diversity. nature"},{"key":"10525_CR31","first-page":"163","volume":"4","author":"T St\u00fctzle","year":"1999","unstructured":"St\u00fctzle T, Dorigo M et al (1999) Aco algorithms for the traveling salesman problem. Evolutionary algorithms in engineering and computer science 4:163\u2013183","journal-title":"Evolutionary algorithms in engineering and computer science"},{"key":"10525_CR32","doi-asserted-by":"crossref","unstructured":"Tang W, Wu Q, Tang W, et\u00a0al (2011) Evolutionary computation. Condition monitoring and assessment of power transformers using computational intelligence pp 15\u201336","DOI":"10.1007\/978-0-85729-052-6_2"},{"key":"10525_CR33","doi-asserted-by":"crossref","unstructured":"Vikhar PA (2016) Evolutionary algorithms: A critical review and its future prospects. In: 2016 International conference on global trends in signal processing, information computing and communication (ICGTSPICC), IEEE, pp 261\u2013265","DOI":"10.1109\/ICGTSPICC.2016.7955308"},{"issue":"1\u20132","key":"10525_CR34","first-page":"245","volume":"85","author":"D Whitley","year":"1996","unstructured":"Whitley D, Rana S, Dzubera J et al (1996) Evaluating evolutionary algorithms. Artificial intelligence 85(1\u20132):245\u2013276","journal-title":"Evaluating evolutionary algorithms. Artificial intelligence"},{"key":"10525_CR35","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00521-013-1367-1","volume":"24","author":"XS Yang","year":"2014","unstructured":"Yang XS, Deb S (2014) Cuckoo search: recent advances and applications. Neural Comput Appl 24:169\u2013174","journal-title":"Neural Comput Appl"},{"issue":"3","key":"10525_CR36","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1504\/IJBIC.2013.055093","volume":"5","author":"XS Yang","year":"2013","unstructured":"Yang XS, He X (2013) Bat algorithm: literature review and applications. International Journal of Bio-inspired computation 5(3):141\u2013149","journal-title":"International Journal of Bio-inspired computation"},{"key":"10525_CR37","doi-asserted-by":"crossref","unstructured":"Yu X, Gen M (2010) Introduction to evolutionary algorithms. Springer Science & Business Media","DOI":"10.1007\/978-1-84996-129-5"},{"key":"10525_CR38","doi-asserted-by":"crossref","unstructured":"Zhong Wh, Zhang J, Chen Wn (2007) A novel discrete particle swarm optimization to solve traveling salesman problem. In: 2007 IEEE congress on evolutionary computation, IEEE, pp 3283\u20133287","DOI":"10.1109\/CEC.2007.4424894"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10525-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10525-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10525-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T06:36:30Z","timestamp":1742193390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10525-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10525"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10525-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"28 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2025","order":2,"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 that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Confict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}]}}