{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T05:59:39Z","timestamp":1781675979140,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,6]],"date-time":"2013-07-06T00:00:00Z","timestamp":1373068800000},"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":[[2013,7,6]]},"DOI":"10.1145\/2463372.2463567","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"1605-1612","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Runtime analysis of ant colony optimization on dynamic shortest path problems"],"prefix":"10.1145","author":[{"given":"Andrei","family":"Lissovoi","sequence":"first","affiliation":[{"name":"Technical University of Denmark, Kgs. Lyngby, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[{"name":"Technical University of Denmark, Kgs. Lyngby, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.08.013"},{"key":"e_1_3_2_1_2_1","volume-title":"World Scientific","author":"Auger Anne","year":"2011","unstructured":"Anne Auger and Benjamin Doerr , editors. Theory of Randomized Seach Heuristics--Foundations and Recent Developments . World Scientific , 2011 . Anne Auger and Benjamin Doerr, editors. Theory of Randomized Seach Heuristics--Foundations and Recent Developments. World Scientific, 2011."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330167"},{"key":"e_1_3_2_1_4_1","unstructured":"Stefan Droste. Analysis of the (1  Stefan Droste. Analysis of the (1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1761233.1761353"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2460239.2460246"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1068009.1068152"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830741"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32937-1_12"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-011-0059-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830493"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.02.012"},{"key":"e_1_3_2_1_13_1","volume-title":"Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity","author":"Neumann Frank","year":"2010","unstructured":"Frank Neumann and Carsten Witt . Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity . Springer , 2010 . Frank Neumann and Carsten Witt. Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity. Springer, 2010."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2012.05.001"},{"key":"e_1_3_2_1_15_1","volume-title":"Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. arXiv:1211.7184","author":"Oliveto P. S.","year":"2012","unstructured":"P. S. Oliveto and Carsten Witt . Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. arXiv:1211.7184 , 2012 . http:\/\/arxiv.org\/abs\/1211.7184. P. S. Oliveto and Carsten Witt. Erratum: Simplified drift analysis for proving lower bounds in evolutionary computation. arXiv:1211.7184, 2012. http:\/\/arxiv.org\/abs\/1211.7184."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9387-z"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570131"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.06.002"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9606-2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2016570"}],"event":{"name":"GECCO '13: Genetic and Evolutionary Computation Conference","location":"Amsterdam The Netherlands","acronym":"GECCO '13","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 15th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463372.2463567","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2463372.2463567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:00Z","timestamp":1750235940000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2463372.2463567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,6]]},"references-count":21,"alternative-id":["10.1145\/2463372.2463567","10.1145\/2463372"],"URL":"https:\/\/doi.org\/10.1145\/2463372.2463567","relation":{},"subject":[],"published":{"date-parts":[[2013,7,6]]},"assertion":[{"value":"2013-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}