{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T02:31:40Z","timestamp":1769913100531,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":42,"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.3533950","type":"proceedings-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T15:29:44Z","timestamp":1658244584000},"page":"1631-1639","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Survivor selection in a crossoverless evolutionary algorithm"],"prefix":"10.1145","author":[{"given":"Nielis","family":"Brouwer","sequence":"first","affiliation":[{"name":"University of Amsterdam, The Netherlands"}]},{"given":"Danny","family":"Dijkzeul","sequence":"additional","affiliation":[{"name":"University of Amsterdam, The Netherlands"}]},{"given":"Levi","family":"Koppenhol","sequence":"additional","affiliation":[{"name":"University of Amsterdam, The Netherlands"}]},{"given":"Iris","family":"Pijning","sequence":"additional","affiliation":[{"name":"University of 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","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1993.1.1.1"},{"key":"e_1_3_2_1_2_1","volume-title":"Benchmarking in Optimization: Best Practice and Open Issues. arXiv","author":"Bartz-Beielstein Thomas","year":"2020","unstructured":"Thomas Bartz-Beielstein, Carola Doerr, Jakob Bossek, Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, Pascal Kerschke, Manuel L\u00f3pez-Ib\u00e1\u00f1ez, Katherine M. Malan, Jason H. Moore, Boris Naujoks, Patryk Orzechowski, Vanessa Volz, Markus Wagner, and Thomas Weise. 2020. Benchmarking in Optimization: Best Practice and Open Issues. arXiv (2020), 1--50. arXiv:2007.03488"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6911(94)90028-0"},{"key":"e_1_3_2_1_4_1","unstructured":"Nielis Brouwer. 2022. Extras. https:\/\/github.com\/PPA-2021\/Survivor_Selection\/tree\/main\/extras."},{"key":"e_1_3_2_1_5_1","unstructured":"Nielis Brouwer. 2022. Source Code. https:\/\/github.com\/PPA-2021\/Survivor_Selection."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93073-2"},{"key":"e_1_3_2_1_7_1","volume-title":"Comparison of Parents Selection Methods of Genetic Algorithm for TSP. International Conference on Computer Communication and Networks CSI- COMNET","author":"Chudasama Chetan","year":"2011","unstructured":"Chetan Chudasama, S.M. Shah, and Mahesh Panchal. 2011. Comparison of Parents Selection Methods of Genetic Algorithm for TSP. International Conference on Computer Communication and Networks CSI- COMNET, 1, January (2011), 102--105."},{"key":"e_1_3_2_1_8_1","volume-title":"International Conference on Computational Creativity (ICCC'20)","author":"Dahmani R","year":"2020","unstructured":"R Dahmani, S Boogmans, A Meijs, and D Van den Berg. 2020. Paintings-from-polygons: Simulated annealing. In International Conference on Computational Creativity (ICCC'20)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5220\/0010134300920099"},{"key":"e_1_3_2_1_10_1","volume-title":"Plant Propagation Parameterization : Offspring & Population Size","author":"Jonge Marleen De","year":"2020","unstructured":"Marleen De Jonge and Daan Van den Berg. 2020. Plant Propagation Parameterization : Offspring & Population Size, Vol. 2. Evo* 2020, 1--4."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-03789-4_4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"A.E. Eiben and J.E. Smith. 2015. Introduction to Evolutionary Computing. Springer Berlin Heidelberg Berlin Heidelberg. 1--294 pages. 10.1007\/978-3-662-44874-8","DOI":"10.1007\/978-3-662-44874-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"A. E. Eiben and S. K. Smit. 2011. Evolutionary Algorithm Parameters and Methods to Tune Them. In Autonomous Search. Vol. 9783642214. Springer Berlin Heidelberg Berlin Heidelberg 15--36. 10.1007\/978-3-642-21434-9_2","DOI":"10.1007\/978-3-642-21434-9_2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16493-4"},{"key":"e_1_3_2_1_15_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_16_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_17_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)."},{"key":"e_1_3_2_1_18_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_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/b101874"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJICA.2020.111229"},{"key":"e_1_3_2_1_21_1","volume-title":"Completely derandomized self-adaptation in evolution strategies. Evolutionary computation 9, 2","author":"Hansen Nikolaus","year":"2001","unstructured":"Nikolaus Hansen and Andreas Ostermeier. 2001. Completely derandomized self-adaptation in evolution strategies. Evolutionary computation 9, 2 (2001), 159--195."},{"key":"e_1_3_2_1_22_1","first-page":"333","article-title":"Selection Methods for Genetic Algorithms","volume":"3","author":"Jebari Khalid","year":"2013","unstructured":"Khalid Jebari and Mohammed Madiafi. 2013. Selection Methods for Genetic Algorithms. International Journal of Emerging Sciences 3, 4 (2013), 333--344.","journal-title":"International Journal of Emerging Sciences"},{"key":"e_1_3_2_1_23_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_24_1","volume-title":"Proceedings of the 2022 Genetic and Evolutionary Computation Conference Companion. (in press).","author":"Koppenhol Levi","year":"2022","unstructured":"Levi Koppenhol, Nielis Brouwer, Danny Dijkzeul, Iris Pijning, Joeri Sleegers, and Daan Van den Berg. 2022. Survivor Selection in a Crossoverless Evolutionary Algorithm. In Proceedings of the 2022 Genetic and Evolutionary Computation Conference Companion. (in press)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5013-8"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.7763\/ijmlc.2012.v2.146"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87700-4_53"},{"key":"e_1_3_2_1_28_1","volume-title":"Molecular basis for the deficiency in humans of gulonolactone oxidase, a key enzyme for ascorbic acid biosynthesis. The American journal of clinical nutrition 54, 6","author":"Nishikimi Morimitsu","year":"1991","unstructured":"Morimitsu Nishikimi and Kunio Yagi. 1991. Molecular basis for the deficiency in humans of gulonolactone oxidase, a key enzyme for ascorbic acid biosynthesis. The American journal of clinical nutrition 54, 6 (1991), 1203S--1208S."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16667-0_6"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781119136378"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_5"},{"key":"e_1_3_2_1_32_1","volume-title":"Evolutionary flaws disprove the theory of intelligent design. partner.sciencenorway.no","author":"R\u00f8sj\u00f8h Bjarne","year":"2020","unstructured":"Bjarne R\u00f8sj\u00f8h. 2020. Evolutionary flaws disprove the theory of intelligent design. partner.sciencenorway.no (2020). https:\/\/partner.sciencenorway.no\/evolution-genetics-natural-sciences\/evolutionary-flaws-disprove-the-theory-of-intelligent-design\/1670232"},{"key":"e_1_3_2_1_33_1","unstructured":"Stuart Russell and Peter Norvig. 2002. Artificial intelligence: a modern approach. (2002)."},{"key":"e_1_3_2_1_34_1","volume-title":"International Conference on Numerical Analysis and Optimization (ICeMATH)","author":"Salhi A","year":"2011","unstructured":"A Salhi and Eric S. Fraga. 2011. Nature-inspired optimisation approaches and the new plant propagation algorithm. International Conference on Numerical Analysis and Optimization (ICeMATH) June (2011), K2."},{"key":"e_1_3_2_1_35_1","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_36_1","doi-asserted-by":"crossref","unstructured":"Joeri Sleegers and Daan van den Berg. 2020. Looking for the Hardest Hamiltonian Cycle Problem Instances.. In IJCCI. 40--48.","DOI":"10.5220\/0010066900400048"},{"key":"e_1_3_2_1_37_1","volume-title":"Plant propagation & hard hamiltonian graphs. Evo* 2020","author":"Sleegers Joeri","year":"2020","unstructured":"Joeri Sleegers and Daan van den Berg. 2020. Plant propagation & hard hamiltonian graphs. Evo* 2020 (2020), 10."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12001"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4_8"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5220\/0008169401010112"},{"key":"e_1_3_2_1_41_1","volume-title":"A Dynamic Parameter for the Plant Propagation Algorithm A Dynamic Parameter for the Plant Propagation Algorithm. Evo*","author":"Vrielink Wouter","year":"2021","unstructured":"Wouter Vrielink and Daan Van den Berg. 2021. A Dynamic Parameter for the Plant Propagation Algorithm A Dynamic Parameter for the Plant Propagation Algorithm. Evo* 2021, 5--9."},{"key":"e_1_3_2_1_42_1","volume-title":"Parameter control for the Plant Propagation Algorithm Parameter control for the Plant Propagation Algorithm. Evo*","author":"Vrielink Wouter","year":"2021","unstructured":"Wouter Vrielink and Daan Van den Berg. 2021. Parameter control for the Plant Propagation Algorithm Parameter control for the Plant Propagation Algorithm. Evo* 2021, 1--4."}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","location":"Boston Massachusetts","acronym":"GECCO '22","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3533950","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3520304.3533950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:23Z","timestamp":1750183763000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520304.3533950"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":42,"alternative-id":["10.1145\/3520304.3533950","10.1145\/3520304"],"URL":"https:\/\/doi.org\/10.1145\/3520304.3533950","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"}}]}}