{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T15:28:09Z","timestamp":1767108489039,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"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":["Appl Intell"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10489-023-04972-z","type":"journal-article","created":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T09:01:57Z","timestamp":1693645317000},"page":"27148-27162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bi-objective parameter setting problem of a genetic algorithm: an empirical study on traveling salesperson problem"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8689-8212","authenticated-orcid":false,"given":"Yavuzhan","family":"Akduran","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3277-4177","authenticated-orcid":false,"given":"Erdi","family":"Dasdemir","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2389-4759","authenticated-orcid":false,"given":"Murat Caner","family":"Testik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,2]]},"reference":[{"issue":"1","key":"4972_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1026569813391","volume":"7","author":"SP Coy","year":"2001","unstructured":"Coy SP, Golden BL, Runger GC, Wasil EA (2001) Using experimental design to find effective parameter settings for heuristics. J Heuristics 7(1):77\u201397","journal-title":"J Heuristics"},{"key":"4972_CR2","doi-asserted-by":"crossref","unstructured":"De Jong K (2007) Parameter setting in EAs: a 30 year perspective. In: Lobo FG, Lima CF, Michalewicz Z (eds) Parameter Setting in Evolutionary Algorithms. Springer, Berlin, Heidelberg, p 1\u201318","DOI":"10.1007\/978-3-540-69432-8_1"},{"issue":"2","key":"4972_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2019.2921598","volume":"24","author":"CW Huang","year":"2020","unstructured":"Huang CW, Li YX, Yao X (2020) A survey of automatic parameter tuning methods for metaheuristics. IEEE Trans Evol Comput 24(2):201\u2013216","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"4972_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10732-019-09431-y","volume":"26","author":"QM Ha","year":"2020","unstructured":"Ha QM, Deville Y, Pham QD, Ha MH (2020) A hybrid genetic algorithm for the traveling salesman problem with drone. J Heuristics 26(2):219\u2013247","journal-title":"J Heuristics"},{"key":"4972_CR5","doi-asserted-by":"crossref","unstructured":"Zhang PL, Wang JQ, Tian ZW, Sun SZ, Li JT, Yang JN (2022) A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem. Appl Soft Comput 127:109339","DOI":"10.1016\/j.asoc.2022.109339"},{"issue":"10","key":"4972_CR6","doi-asserted-by":"publisher","first-page":"11420","DOI":"10.1007\/s10489-022-03976-5","volume":"53","author":"K Panwar","year":"2022","unstructured":"Panwar K, Deep K (2022) Discrete salp swarm algorithm for Euclidean travelling salesman problem. Appl Intell 53(10):11420\u201311438","journal-title":"Appl Intell"},{"issue":"3","key":"4972_CR7","first-page":"933","volume":"9","author":"RZ Zheng","year":"2022","unstructured":"Zheng RZ, Zhang Y, Yang K (2022) A transfer learning-based particle swarm optimization algorithm for travelling salesman problem. J Comput Des Eng 9(3):933\u2013948","journal-title":"J Comput Des Eng"},{"issue":"12","key":"4972_CR8","doi-asserted-by":"publisher","first-page":"4529","DOI":"10.1007\/s10489-020-01799-w","volume":"50","author":"K Yang","year":"2020","unstructured":"Yang K, You XM, Liu S, Pan H (2020) A novel ant colony optimization based on game for traveling salesman problem. Appl Intell 50(12):4529\u20134542","journal-title":"Appl Intell"},{"key":"4972_CR9","doi-asserted-by":"crossref","unstructured":"Mosayebi M, Sodhi M (2020) Tuning genetic algorithm parameters using design of experiments. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, p 1937\u20131944","DOI":"10.1145\/3377929.3398136"},{"key":"4972_CR10","doi-asserted-by":"crossref","unstructured":"Ramos ICO, Goldbarg MC, Goldbarg EG, Neto ADD (2005) Logistic regression for parameter tuning on an evolutionary algorithm. 2005 IEEE Congress on Evolutionary Computation vols 1\u20133, p 1061\u20131068","DOI":"10.1109\/CEC.2005.1554808"},{"issue":"5","key":"4972_CR11","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch S, Chauhan SS, Kumar V (2021) A review on genetic algorithm: past, present, and future. Multimedia Tools Appl 80(5):8091\u20138126","journal-title":"Multimedia Tools Appl"},{"key":"4972_CR12","doi-asserted-by":"crossref","unstructured":"Smit SK, Eiben AE (2009) Comparing parameter tuning methods for evolutionary algorithms. 2009 IEEE Congress on Evolutionary Computation, vols 1\u20135, p 399\u2013406","DOI":"10.1109\/CEC.2009.4982974"},{"issue":"1","key":"4972_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.swevo.2011.02.001","volume":"1","author":"AE Eiben","year":"2011","unstructured":"Eiben AE, Smit SK (2011) Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm Evol Comput 1(1):19\u201331","journal-title":"Swarm Evol Comput"},{"key":"4972_CR14","doi-asserted-by":"crossref","unstructured":"de Lacerda MGP, Pessoa LFD, Neto FBD, Ludermir TB, Kuchen H (2021) A systematic literature review on general parameter control for evolutionary and swarm-based algorithms. Swarm Evol Comput 60:100777","DOI":"10.1016\/j.swevo.2020.100777"},{"key":"4972_CR15","doi-asserted-by":"crossref","unstructured":"Nannen V, Eiben AE (2006) A method for parameter calibration and relevance estimation in evolutionary-algorithms. Gecco 2006: Genetic and Evolutionary Computation Conference vols 1 and 2, 183","DOI":"10.1145\/1143997.1144029"},{"key":"4972_CR16","unstructured":"Bartz-Beielstein T, Lasarczyk CWG, Preuss M (2005) Sequential parameter optimization. In: 2005 IEEE Congress on Evolutionary Computation"},{"issue":"4","key":"4972_CR17","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, Turlach B, Gupta R (2004) Statistical exploratory analysis of genetic algorithms. IEEE Trans Evol Comput 8(4):405\u2013421","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"4972_CR18","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1057\/jors.2010.74","volume":"62","author":"FJ Vasko","year":"2011","unstructured":"Vasko FJ, Bobeck JD, Governale MA, Rieksts DJ, Keffer JD (2011) A statistical analysis of parameter values for the rank-based ant colony optimization algorithm for the traveling salesperson problem. J Oper Res Soc 62(6):1169\u20131176","journal-title":"J Oper Res Soc"},{"issue":"1","key":"4972_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B Adenso-Diaz","year":"2006","unstructured":"Adenso-Diaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res 54(1):99\u2013114","journal-title":"Oper Res"},{"issue":"8","key":"4972_CR20","doi-asserted-by":"publisher","first-page":"5978","DOI":"10.1007\/s10489-020-02151-y","volume":"51","author":"JA Mejia-de-Dios","year":"2021","unstructured":"Mejia-de-Dios JA, Mezura-Montes E, Quiroz-Castellanos M (2021) Automated parameter tuning as a bilevel optimization problem solved by a surrogate-assisted population-based approach. Appl Intell 51(8):5978\u20136000","journal-title":"Appl Intell"},{"issue":"1","key":"4972_CR21","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","volume":"16","author":"JJ Grefenstette","year":"1986","unstructured":"Grefenstette JJ (1986) Optimization of control parameters for genetic algorithms. IEEE Trans Syst Man Cybernetics 16(1):122\u2013128","journal-title":"IEEE Trans Syst Man Cybernetics"},{"key":"4972_CR22","doi-asserted-by":"crossref","unstructured":"Dr\u00e9o J (2009) Using performance fronts for parameter setting of stochastic metaheuristics. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers. Association for Computing Machinery: Montreal, Qu\u00e9bec, Canada, p 2197\u20132200","DOI":"10.1145\/1570256.1570301"},{"key":"4972_CR23","doi-asserted-by":"crossref","unstructured":"Ugolotti R, Cagnoni S (2014) Analysis of evolutionary algorithms using multi-objective parameter tuning. GECCO\u201914: Proceedings of the 2014 Genetic and Evolutionary Computation Conference, p 1343\u20131350","DOI":"10.1145\/2576768.2598226"},{"issue":"3","key":"4972_CR24","doi-asserted-by":"publisher","first-page":"232","DOI":"10.3390\/math7030232","volume":"7","author":"R Ugolotti","year":"2019","unstructured":"Ugolotti R, Sani L, Cagnoni S (2019) What can we learn from multi-objective meta-optimization of evolutionary algorithms in continuous domains? Mathematics 7(3):232","journal-title":"Mathematics"},{"key":"4972_CR25","doi-asserted-by":"crossref","unstructured":"Zhang TT, Georgiopoulos M, Anagnostopoulos GC (2015) SPRINT Multi-Objective Model Racing. Gecco\u201915: Proceedings of the 2015 Genetic and Evolutionary Computation Conference, p 1383\u20131390","DOI":"10.1145\/2739480.2754791"},{"issue":"8","key":"4972_CR26","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1109\/TCYB.2015.2456187","volume":"46","author":"TT Zhang","year":"2016","unstructured":"Zhang TT, Georgiopoulos M, Anagnostopoulos GC (2016) Multi-objective model selection via racing. IEEE Trans Cybernetics 46(8):1863\u20131876","journal-title":"IEEE Trans Cybernetics"},{"key":"4972_CR27","doi-asserted-by":"crossref","unstructured":"Dasdemir E, K\u00f6ksalan M, Tezcaner \u00d6zt\u00fcrk D (2020) A flexible reference point-based multi-objective evolutionary algorithm: An application to the UAV route planning problem. Comput Oper Res 114:104811","DOI":"10.1016\/j.cor.2019.104811"},{"issue":"1","key":"4972_CR28","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1(1):32\u201349","journal-title":"Swarm Evol Comput"},{"key":"4972_CR29","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/978-3-662-43505-2_49","volume-title":"Springer Handbook of Computational Intelligence","author":"K Deb","year":"2015","unstructured":"Deb K (2015) Multi-objective evolutionary algorithms. In: Kacprzyk J, Pedrycz W (eds) Springer Handbook of Computational Intelligence. Springer, Berlin Heidelberg, pp 995\u20131015"},{"key":"4972_CR30","unstructured":"GUROBI (2023) Documentation: MIPGap; Available from: https:\/\/www.gurobi.com\/documentation\/9.0\/refman\/mipgap.html. Accessed 1 May 2023"},{"issue":"2","key":"4972_CR31","doi-asserted-by":"publisher","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"},{"key":"4972_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v053.i04","volume":"53","author":"L Scrucca","year":"2013","unstructured":"Scrucca L (2013) GA: a package for genetic algorithms in R. J Stat Softw 53:1\u201337","journal-title":"J Stat Softw"},{"key":"4972_CR33","unstructured":"R Core Team (2023) R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria.\u00a0 Available from: https:\/\/www.R-project.org\/. Accessed 1 May 2023"},{"issue":"17","key":"4972_CR34","doi-asserted-by":"publisher","first-page":"12855","DOI":"10.1007\/s00500-020-04712-2","volume":"24","author":"PV Paul","year":"2020","unstructured":"Paul PV, Ganeshkumar C, Dhavachelvan P, Baskaran R (2020) A novel ODV crossover operator-based genetic algorithms for traveling salesman problem. Soft Comput 24(17):12855\u201312885","journal-title":"Soft Comput"},{"key":"4972_CR35","unstructured":"CCR (2023) The Center for computational research. University at Buffalo. http:\/\/hdl.handle.net\/10477\/79221.\u00a0Accessed 1 May 2023"},{"key":"4972_CR36","unstructured":"Tsou CS (2013) nsga2R: elitist non-dominated sorting genetic algorithm. R Package version, 1.1. Available from: https:\/\/CRAN.R-project.org\/package=nsga2R. Accessed 1 May 2023"},{"key":"4972_CR37","unstructured":"Mersmann O, Trautmann H, Steuer D, Bischl B, Deb K (2014) mco: multiple criteria optimization algorithms and related functions. R package version, 1.15.6. Available from: https:\/\/CRAN.R-project.org\/package=mco. Accessed 1 May 2023"},{"issue":"2","key":"4972_CR38","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata Y, Kobayashi S (2013) A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. Informs J Comput 25(2):346\u2013363","journal-title":"Informs J Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04972-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04972-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04972-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T23:14:41Z","timestamp":1698275681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04972-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,2]]},"references-count":38,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["4972"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04972-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2023,9,2]]},"assertion":[{"value":"14 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest\/ Competing interests"}}]}}