{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:10:55Z","timestamp":1750306255531,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"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":[[2017,7]]},"DOI":"10.1145\/3071178.3071225","type":"proceedings-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T17:59:28Z","timestamp":1498845568000},"page":"219-226","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Parameter-less late acceptance hill-climbing"],"prefix":"10.1145","author":[{"given":"Mosab","family":"Bazargani","sequence":"first","affiliation":[{"name":"Queen Mary University of London, London, United Kingdom"}]},{"given":"Fernando G.","family":"Lobo","sequence":"additional","affiliation":[{"name":"Universidade do Algarve, Faro, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2017,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1554902"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908917"},{"key":"e_1_3_2_2_3_1","volume-title":"Proceedings of the 7th International Conference on the Practice and Theory of Automating Timetabling (PATAT","author":"Edmund","year":"2008","unstructured":"Edmund K. Burke and Yuri Bykov. 2008. A late acceptance strategy in hill-climbing for exam timetabling problems . In Proceedings of the 7th International Conference on the Practice and Theory of Automating Timetabling (PATAT 2008 ). extended abstract. Edmund K. Burke and Yuri Bykov. 2008. A late acceptance strategy in hill-climbing for exam timetabling problems. In Proceedings of the 7th International Conference on the Practice and Theory of Automating Timetabling (PATAT 2008). extended abstract."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.07.012"},{"key":"e_1_3_2_2_5_1","volume-title":"Bosman","author":"den Besten Willem","year":"2016","unstructured":"Willem den Besten , Dirk Thierens , and Peter A. N . Bosman . 2016 . The Multiple Insertion Pyramid: A Fast Parameter-Less Population Scheme. In Parallel Problem Solving from Nature - PPSN XIV - 14th International Conference, Edinburgh, UK, September 17--21, 2016, Proceedings (Lecture Notes in Computer Science), Julia Handl, Emma Hart, Peter R. Lewis, Manuel L\u00f3pez-Ib\u00e1\u00f1ez, Gabriela Ochoa, and Ben Paechter (Eds.), Vol. 9921 . Springer , 48--58. Willem den Besten, Dirk Thierens, and Peter A. N. Bosman. 2016. The Multiple Insertion Pyramid: A Fast Parameter-Less Population Scheme. In Parallel Problem Solving from Nature - PPSN XIV - 14th International Conference, Edinburgh, UK, September 17--21, 2016, Proceedings (Lecture Notes in Computer Science), Julia Handl, Emma Hart, Peter R. Lewis, Manuel L\u00f3pez-Ib\u00e1\u00f1ez, Gabriela Ochoa, and Ben Paechter (Eds.), Vol. 9921. Springer, 48--58."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1993.1010"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9991(90)90201-B"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.3.231"},{"volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99","author":"Georges","key":"e_1_3_2_2_10_1","unstructured":"Georges R. Harik and Fernando G. Lobo. 1999. A parameter-less genetic algorithm . In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99 , W. Banzhaf and others (Eds.). Morgan Kaufmann, San Francisco, CA, 258--265. Georges R. Harik and Fernando G. Lobo. 1999. A parameter-less genetic algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, W. Banzhaf and others (Eds.). Morgan Kaufmann, San Francisco, CA, 258--265."},{"key":"e_1_3_2_2_12_1","volume-title":"Vecchi","author":"Kirkpatrick Scott","year":"1983","unstructured":"Scott Kirkpatrick , C. D. Gelatt , and Mario P . Vecchi . 1983 . Optimization by Simulated Annealing. Science, Number 4598, 13 May 1983 220, 4598 (1983), 671--680. Scott Kirkpatrick, C. D. Gelatt, and Mario P. Vecchi. 1983. Optimization by Simulated Annealing. Science, Number 4598, 13 May 1983 220, 4598 (1983), 671--680."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754682"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24855-2_3"},{"key":"e_1_3_2_2_16_1","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation, CEC","author":"Smorodkina Ekaterina","year":"2007","unstructured":"Ekaterina Smorodkina and Daniel R. Tauritz . 2007. Greedy Population Sizing for Evolutionary Algorithms . In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007 . IEEE, 2181--2187. Ekaterina Smorodkina and Daniel R. Tauritz. 2007. Greedy Population Sizing for Evolutionary Algorithms. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007. IEEE, 2181--2187."}],"event":{"name":"GECCO '17: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Berlin Germany","acronym":"GECCO '17"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071225","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3071178.3071225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:05Z","timestamp":1750220645000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3071178.3071225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":15,"alternative-id":["10.1145\/3071178.3071225","10.1145\/3071178"],"URL":"https:\/\/doi.org\/10.1145\/3071178.3071225","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"2017-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}