{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:40Z","timestamp":1750220080710,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":69,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,9]]},"DOI":"10.1145\/3520304.3533968","type":"proceedings-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T15:29:44Z","timestamp":1658244584000},"page":"1640-1649","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Exactly characterizable parameter settings in a crossoverless evolutionary algorithm"],"prefix":"10.1145","author":[{"given":"Levi","family":"Koppenhol","sequence":"first","affiliation":[{"name":"University of Amsterdam, The Netherlands"}]},{"given":"Nielis","family":"Brouwer","sequence":"additional","affiliation":[{"name":"University of Amsterdam, The Netherlands"}]},{"given":"Danny","family":"Dijkzeul","sequence":"additional","affiliation":[{"name":"University of Amsterdam, The Netherlands"}]},{"given":"Iris","family":"Pijning","sequence":"additional","affiliation":[{"name":"University of Amsterdam, The Netherlands"}]},{"given":"Joeri","family":"Sleegers","sequence":"additional","affiliation":[{"name":"Mice & Man, Amsterdam, The Netherlands"}]},{"given":"Daan","family":"van den Berg","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Cook","author":"Applegate David L.","year":"2011","unstructured":"David L. Applegate, Robert E. Bixby, Va\u0161ek Chv\u00e1tal, and William J. Cook. 2011. The traveling salesman problem. Princeton university press."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1016\/j.orl.2008.09.006"},{"key":"e_1_3_2_1_3_1","volume-title":"Cook","author":"Applegate David L.","year":"2006","unstructured":"David L. Applegate, Robert E. Bixby, Va\u0161ek Chv\u00e1tal, and William J. Cook. 2006. The Traveling Salesman Problem: A Computational Study. Princeton University Press."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/s11721-021-00202-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/290179.290180"},{"key":"e_1_3_2_1_6_1","volume-title":"Manuel Lopez-Ibanez, et al.","author":"Bartz-Beielstein Thomas","year":"2020","unstructured":"Thomas Bartz-Beielstein, Carola Doerr, Daan van den Berg, Jakob Bossek, Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, Pascal Kerschke, William La Cava, Manuel Lopez-Ibanez, et al. 2020. Benchmarking in optimization: Best practice and open issues. arXiv preprint arXiv:2007.03488 (2020)."},{"volume-title":"Tuning metaheuristics: a machine learning perspective","author":"Birattari Mauro","unstructured":"Mauro Birattari and Janusz Kacprzyk. 2009. Tuning metaheuristics: a machine learning perspective. Vol. 197. Springer.","key":"e_1_3_2_1_7_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/3520304.3533950"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1038\/scientificamerican0397-121"},{"key":"e_1_3_2_1_11_1","volume-title":"A method for solving traveling-salesman problems. Operations research 6, 6","author":"Croes Georges A","year":"1958","unstructured":"Georges A Croes. 1958. A method for solving traveling-salesman problems. Operations research 6, 6 (1958), 791--812."},{"unstructured":"Daan van den Berg. 2019. Refurbished version of Lital's paper. http:\/\/heuristieken.nl\/wiki\/index.php?title=CheesemanTSPReplication Last accessed on january 9th 2022.","key":"e_1_3_2_1_12_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1287\/opre.2.4.393"},{"doi-asserted-by":"crossref","unstructured":"Marleen De Jonge and Daan van den Berg. 2020. Parameter Sensitivity Patterns in the Plant Propagation Algorithm.. In IJCCI. 92--99.","key":"e_1_3_2_1_14_1","DOI":"10.5220\/0010134300920099"},{"key":"e_1_3_2_1_15_1","volume-title":"Plant Propagation Parameterization: Offspring & Population Size. Evo* 2020","author":"de Jonge Marleen","year":"2020","unstructured":"Marleen de Jonge and Daan van den Berg. 2020. Plant Propagation Parameterization: Offspring & Population Size. Evo* 2020 (2020), 19."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1007\/978-3-031-03789-4_4"},{"key":"e_1_3_2_1_17_1","volume-title":"Ant colony optimization","author":"Dorigo Marco","year":"2006","unstructured":"Marco Dorigo, Mauro Birattari, and Thomas Stutzle. 2006. Ant colony optimization. IEEE computational intelligence magazine 1, 4 (2006), 28--39."},{"volume-title":"Autonomous search","author":"Eiben Agoston Endre","unstructured":"Agoston Endre Eiben and Selmar K Smit. 2011. Evolutionary algorithm parameters and methods to tune them. In Autonomous search. Springer, 15--36.","key":"e_1_3_2_1_18_1"},{"doi-asserted-by":"crossref","unstructured":"Agoston E Eiben James E Smith et al. 2003. Introduction to evolutionary computing. Vol. 53. Springer.","key":"e_1_3_2_1_19_1","DOI":"10.1007\/978-3-662-05094-1"},{"key":"e_1_3_2_1_20_1","volume-title":"The traveling-salesman problem. Operations research 4, 1","author":"Flood Merrill M","year":"1956","unstructured":"Merrill M Flood. 1956. The traveling-salesman problem. Operations research 4, 1 (1956), 61--75."},{"key":"e_1_3_2_1_21_1","first-page":"110","article-title":"Fresa: A Plant Propagation Algorithm for Black-Box Single and Multiple Objective Optimization","volume":"2","author":"Fraga ES","year":"2021","unstructured":"ES Fraga. 2021. Fresa: A Plant Propagation Algorithm for Black-Box Single and Multiple Objective Optimization. Int J Eng Tech & Inf 2, 4 (2021), 110--111.","journal-title":"Int J Eng Tech & Inf"},{"key":"e_1_3_2_1_22_1","first-page":"601","article-title":"An example of multi-objective optimization for dynamic processes","volume":"74","author":"Fraga Eric S","year":"2019","unstructured":"Eric S Fraga. 2019. An example of multi-objective optimization for dynamic processes. Chemical Engineering Transactions 74 (2019), 601--606.","journal-title":"Chemical Engineering Transactions"},{"key":"e_1_3_2_1_23_1","volume-title":"Multiple simultaneous solution representations in a population based evolutionary algorithm. arXiv preprint arXiv:2106.05096","author":"Fraga Eric S","year":"2021","unstructured":"Eric S Fraga. 2021. Multiple simultaneous solution representations in a population based evolutionary algorithm. arXiv preprint arXiv:2106.05096 (2021)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/800113.803626"},{"key":"e_1_3_2_1_25_1","volume-title":"The plant propagation algorithm on timetables: First results. EVO* 2019","author":"Geleijn Romi","year":"2019","unstructured":"Romi Geleijn, Marrit van der Meer, Quinten van der Post, and Daan van den Berg. 2019. The plant propagation algorithm on timetables: First results. EVO* 2019 (2019), 2."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the first International Conference on Genetic Algorithms and their Applications","volume":"160","author":"Grefenstette John","year":"1985","unstructured":"John Grefenstette, Rajeev Gopal, Brian Rosmaita, and Dirk Van Gucht. 1985. Genetic algorithms for the traveling salesman problem. In Proceedings of the first International Conference on Genetic Algorithms and their Applications, Vol. 160. Lawrence Erlbaum, 160--168."},{"key":"e_1_3_2_1_27_1","first-page":"61","article-title":"Optimal control of plotting and drilling machines: a case study","volume":"35","author":"Gr\u00f6tschel Martin","year":"1991","unstructured":"Martin Gr\u00f6tschel, Michael J\u00fcnger, and Gerhard Reinelt. 1991. Optimal control of plotting and drilling machines: a case study. Zeitschrift f\u00fcr Operations Research 35, 1 (1991), 61--84.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1007\/BF02430364"},{"key":"e_1_3_2_1_30_1","volume-title":"Source Code of Lital's algorithm. https:\/\/github.com\/Joeri1324\/Littles-Algorithm-Sleegers-et-al. (Last accessed on january 31st","author":"Sleegers Joeri","year":"2022","unstructured":"Joeri Sleegers. 2022. Source Code of Lital's algorithm. https:\/\/github.com\/Joeri1324\/Littles-Algorithm-Sleegers-et-al. (Last accessed on january 31st, 2022)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3406325.3451009"},{"key":"e_1_3_2_1_32_1","volume-title":"Optimization by simulated annealing. science 220, 4598","author":"Kirkpatrick Scott","year":"1983","unstructured":"Scott Kirkpatrick, C Daniel Gelatt, and Mario P Vecchi. 1983. Optimization by simulated annealing. science 220, 4598 (1983), 671--680."},{"key":"e_1_3_2_1_33_1","first-page":"76","article-title":"Computer Scientists Break Traveling Salesperson Record","volume":"17","author":"Klarreich Erica","year":"2020","unstructured":"Erica Klarreich. 2020. Computer Scientists Break Traveling Salesperson Record. Quantamagazine 17 (2020), 76--79. https:\/\/www.quantamagazine.org\/computer-scientists-break-traveling-salesperson-record-20201008\/.","journal-title":"Quantamagazine"},{"key":"e_1_3_2_1_34_1","volume-title":"Last accessed on January 31st","author":"Koppenhol Levi","year":"2022","unstructured":"Levi Koppenhol and Nielis Brouwer. 2022. Source Code, results and data of this study. https:\/\/github.com\/PPAParameters\/PPATSPParameters, Last accessed on January 31st, 2022."},{"unstructured":"Eric S Lander Lauren M Linton Bruce Birren Chad Nusbaum Michael C Zody Jennifer Baldwin Keri Devon Ken Dewar Michael Doyle William FitzHugh et al. 2001. Initial sequencing and analysis of the human genome. (2001).","key":"e_1_3_2_1_35_1"},{"volume-title":"North-Holland Mathematics Studies.","author":"Laporte Gilbert","unstructured":"Gilbert Laporte and Yves Nobert. 1987. Exact algorithms for the vehicle routing problem. In North-Holland Mathematics Studies. Vol. 132. Elsevier, 147--184.","key":"e_1_3_2_1_36_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_2_1_38_1","volume-title":"An algorithm for the traveling salesman problem. Operations research 11, 6","author":"Little John DC","year":"1963","unstructured":"John DC Little, Katta G Murty, Dura W Sweeney, and Caroline Karel. 1963. An algorithm for the traveling salesman problem. Operations research 11, 6 (1963), 972--989."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1287\/inte.16.4.13"},{"key":"e_1_3_2_1_40_1","first-page":"12","article-title":"Zweimal travelling salesman","volume":"25","author":"M\u00fcller-Merbach Heiner","year":"1983","unstructured":"Heiner M\u00fcller-Merbach. 1983. Zweimal travelling salesman. DGOR-Bulletin 25 (1983), 12--13.","journal-title":"DGOR-Bulletin"},{"volume-title":"Efficient relevance estimation and value calibration of evolutionary algorithm parameters. In 2007 IEEE congress on evolutionary computation","author":"Nannen Volker","unstructured":"Volker Nannen and Agoston E Eiben. 2007. Efficient relevance estimation and value calibration of evolutionary algorithm parameters. In 2007 IEEE congress on evolutionary computation. IEEE, 103--110.","key":"e_1_3_2_1_41_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1007\/978-3-540-87700-4_53"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1007\/978-3-030-16667-0_6"},{"key":"e_1_3_2_1_44_1","volume-title":"The Euclidean travelling salesman problem is NP-complete. Theoretical computer science 4, 3","author":"Papadimitriou Christos H","year":"1977","unstructured":"Christos H Papadimitriou. 1977. The Euclidean travelling salesman problem is NP-complete. Theoretical computer science 4, 3 (1977), 237--244."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1007\/BF02125403"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.1007\/978-3-319-99259-4_22"},{"key":"e_1_3_2_1_47_1","volume-title":"On the capacitated vehicle routing problem. Mathematical programming 94, 2","author":"Ralphs Ted K","year":"2003","unstructured":"Ted K Ralphs, Leonid Kopman, William R Pulleyblank, and Leslie E Trotter. 2003. On the capacitated vehicle routing problem. Mathematical programming 94, 2 (2003), 343--359."},{"key":"e_1_3_2_1_48_1","volume-title":"TSPLIB --- A Traveling Salesman Problem Library. ORSA journal on computing 3, 4","author":"Reinelt Gerhard","year":"1991","unstructured":"Gerhard Reinelt. 1991. TSPLIB --- A Traveling Salesman Problem Library. ORSA journal on computing 3, 4 (1991), 376--384."},{"unstructured":"Abdellah Salhi and Eric S Fraga. 2011. Nature-inspired optimisation approaches and the new plant propagation algorithm. (2011).","key":"e_1_3_2_1_49_1"},{"key":"e_1_3_2_1_50_1","first-page":"433","article-title":"A retrospective view of MIRIAD","volume":"77","author":"Sault Robert J","year":"1995","unstructured":"Robert J Sault, Peter J Teuben, and Mel CH Wright. 1995. A retrospective view of MIRIAD. In Astronomical Data Analysis Software and Systems IV, Vol. 77. 433.","journal-title":"Astronomical Data Analysis Software and Systems IV"},{"volume-title":"Nature-inspired computation in engineering","author":"Selamo\u011flu Birsen","unstructured":"Birsen \u0130 Selamo\u011flu and Abdellah Salhi. 2016. The plant propagation algorithm for discrete optimisation: The case of the travelling salesman problem. In Nature-inspired computation in engineering. Springer, 43--61.","key":"e_1_3_2_1_51_1"},{"volume-title":"Recent Developments in Metaheuristics","author":"Selamo\u011flu Birsen \u0130rem","unstructured":"Birsen \u0130rem Selamo\u011flu, Abdellah Salhi, and Muhammad Sulaiman. 2018. Strip algorithms as an efficient way to initialise population-based metaheuristics. In Recent Developments in Metaheuristics. Springer, 319--331.","key":"e_1_3_2_1_52_1"},{"key":"e_1_3_2_1_53_1","volume-title":"O nekotorykh ekstremal'nykh obkhodakh v grafakh. Upravlyayemyye sistemy 17","author":"Serdyukov AI","year":"1978","unstructured":"AI Serdyukov. 1978. O nekotorykh ekstremal'nykh obkhodakh v grafakh. Upravlyayemyye sistemy 17 (1978), 76--79. Original article in Russian is here: http:\/\/nas1.math.nsc.ru\/aim\/journals\/us\/us17\/us17_007.pdf."},{"key":"e_1_3_2_1_54_1","volume-title":"arXiv preprint arXiv:2107.00314","author":"Sleegers Joeri","year":"2021","unstructured":"Joeri Sleegers and Daan van den Berg. 2021. Backtracking (the) Algorithms on the Hamiltonian Cycle Problem. arXiv preprint arXiv:2107.00314 (2021)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_55_1","DOI":"10.1016\/j.orp.2020.100160"},{"volume-title":"ECTA2020 Best Paper Award..","author":"Sleegers Joeri","unstructured":"Joeri Sleegers and Daan van den Berg. 2020. Looking for the Hardest Hamiltonian Cycle Problem Instances. In IJCCI. 40--48. ECTA2020 Best Paper Award..","key":"e_1_3_2_1_56_1"},{"key":"e_1_3_2_1_57_1","volume-title":"10","author":"Sleegers Joeri","year":"2020","unstructured":"Joeri Sleegers and Daan van den Berg. 2020. Plant Propagation & Hard Hamiltonian Graphs. Evo* 2020 (2020), 10."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_58_1","DOI":"10.1111\/itor.12001"},{"key":"e_1_3_2_1_59_1","volume-title":"The plant propagation algorithm: modifications and implementation. arXiv preprint arXiv:1412.4290","author":"Sulaiman Muhammad","year":"2014","unstructured":"Muhammad Sulaiman, Abdellah Salhi, and Eric S Fraga. 2014. The plant propagation algorithm: modifications and implementation. arXiv preprint arXiv:1412.4290 (2014)."},{"key":"e_1_3_2_1_60_1","first-page":"201","article-title":"A novel plant propagation algorithm: modifications and implementation","volume":"28","author":"Sulaiman Muhammad","year":"2016","unstructured":"Muhammad Sulaiman, Abdellah Salhi, Eric S Fraga, Wali Khan Mashwani, and Muhammad M Rashidi. 2016. A novel plant propagation algorithm: modifications and implementation. Science International 28, 1 (2016), 201--209.","journal-title":"Science International"},{"key":"e_1_3_2_1_61_1","volume-title":"On the theoretical analysis of the plant propagation algorithms. Mathematical Problems in Engineering 2018","author":"Sulaiman Muhammad","year":"2018","unstructured":"Muhammad Sulaiman, Abdellah Salhi, Asfandyar Khan, Shakoor Muhammad, and Wali Khan. 2018. On the theoretical analysis of the plant propagation algorithms. Mathematical Problems in Engineering 2018 (2018)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_62_1","DOI":"10.1137\/0212009"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_63_1","DOI":"10.1016\/j.hm.2020.04.003"},{"key":"e_1_3_2_1_64_1","volume-title":"DATA ANALYTICS 2018","author":"van Horn Gijs","year":"2018","unstructured":"Gijs van Horn, Richard Olij, Joeri Sleegers, and Daan van den Berg. 2018. A predictive data analytic for the hardness of hamiltonian cycle problem instances. DATA ANALYTICS 2018 (2018), 101."},{"unstructured":"J Craig Venter Mark D Adams Eugene W Myers Peter W Li Richard J Mural Granger G Sutton Hamilton O Smith Mark Yandell Cheryl A Evans Robert A Holt et al. 2001. The sequence of the human genome. science 291 5507 (2001) 1304--1351.","key":"e_1_3_2_1_65_1"},{"key":"e_1_3_2_1_66_1","first-page":"37","article-title":"Design for debug: Catching design errors in digital chips","volume":"19","author":"Vermeulen Bart","year":"2002","unstructured":"Bart Vermeulen and Sandeep Kumar Goel. 2002. Design for debug: Catching design errors in digital chips. IEEE Design & Test of Computers 19, 03 (2002), 37--45.","journal-title":"IEEE Design & Test of Computers"},{"doi-asserted-by":"crossref","unstructured":"Wouter Vrielink and Daan van den Berg. 2019. Fireworks Algorithm versus Plant Propagation Algorithm.. In IJCCI. 101--112.","key":"e_1_3_2_1_67_1","DOI":"10.5220\/0008169401010112"},{"key":"e_1_3_2_1_68_1","volume-title":"A Dynamic Parameter for the Plant Propagation Algorithm. Evo* 2021","author":"Vrielink Wouter","year":"2021","unstructured":"Wouter Vrielink and Daan van den Berg. 2021. A Dynamic Parameter for the Plant Propagation Algorithm. Evo* 2021 (2021), 5."},{"key":"e_1_3_2_1_69_1","volume-title":"Parameter control for the Plant Propagation Algorithm. Evo* 2021","author":"Vrielink Wouter","year":"2021","unstructured":"Wouter Vrielink and Daan van den Berg. 2021. Parameter control for the Plant Propagation Algorithm. Evo* 2021 (2021), 1."},{"volume-title":"Combinatorial optimization---eureka, you shrink!","author":"Woeginger Gerhard J","unstructured":"Gerhard J Woeginger. 2003. Exact algorithms for NP-hard problems: A survey. In Combinatorial optimization---eureka, you shrink! Springer, 185--207.","key":"e_1_3_2_1_70_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_71_1","DOI":"10.1016\/0004-3702(95)00054-2"}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"acronym":"GECCO '22","name":"GECCO '22: Genetic and Evolutionary Computation Conference","location":"Boston Massachusetts"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3533968","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3520304.3533968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:24Z","timestamp":1750183764000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3533968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":69,"alternative-id":["10.1145\/3520304.3533968","10.1145\/3520304"],"URL":"https:\/\/doi.org\/10.1145\/3520304.3533968","relation":{},"subject":[],"published":{"date-parts":[[2022,7,9]]},"assertion":[{"value":"2022-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}