{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T07:29:27Z","timestamp":1765438167888,"version":"3.37.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/tevc.2009.2016570","type":"journal-article","created":{"date-parts":[[2009,8,12]],"date-time":"2009-08-12T14:57:23Z","timestamp":1250089043000},"page":"1083-1092","source":"Crossref","is-referenced-by-count":101,"title":["Runtime Analysis of an Ant Colony Optimization Algorithm for TSP Instances"],"prefix":"10.1109","volume":"13","author":[{"family":"Yuren Zhou","sequence":"first","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1016\/j.ipl.2007.06.016"},{"key":"ref32","first-page":"589","article-title":"simulated annealing beats metropolis in combinatorial optimization","volume":"3580","author":"wegener","year":"2005","journal-title":"Proc ICALP"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1016\/S0377-2217(99)00284-2"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1287\/opre.21.2.498"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/S0304-3975(01)00182-7"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/j.jda.2004.02.001"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1016\/S0304-3975(02)00137-8"},{"key":"ref13","first-page":"44","article-title":"worst-case and average-case approximations by simple randomized search heuristic","volume":"3404","author":"witt","year":"2005","journal-title":"Proc 10th Ann Symp Theoretical Aspects Comput Sci"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/1068009.1068202"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TSMCC.2004.841903"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/CEC.2007.4424800"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/1276958.1277118","article-title":"approximating covering problems by randomized search heuristics using multiobjective models","author":"friedrich","year":"2007","journal-title":"Proc Genetic Evol Comput Conf (GECCO)"},{"key":"ref18","first-page":"618","article-title":"runtime analysis of a simple ant colony optimization algorithm","volume":"4288","author":"neumann","year":"2006","journal-title":"Proc 15th Int l Symp Algorithms and Computation (ISAAC)"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.cor.2006.12.017"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1016\/S0167-739X(00)00043-1"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/MCI.2006.329691"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1007\/978-3-540-74446-7_5"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.7551\/mitpress\/1290.003.0007","author":"dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/S0167-739X(00)00044-3"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1007\/s11721-007-0001-1"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/j.tcs.2005.05.020"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/s11009-006-7291-4"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TEVC.2002.802444"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/3477.484436"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/B:ANOR.0000039526.52305.af","article-title":"model-based search for combinatorial optimization: a critical survey","volume":"131","author":"zlochin","year":"2004","journal-title":"Ann Oper Res"},{"year":"1991","author":"dorigo","journal-title":"The Ant System An Autocatalytic Optimizing Process","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/CEC.2007.4424512"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1007\/s11009-007-9047-1"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/1276958.1276964"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/978-3-540-92695-5_12"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/s11721-008-0023-3"},{"key":"ref26","first-page":"1","author":"lawler","year":"1985","journal-title":"The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1016\/j.ipl.2007.08.013"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4235\/5257407\/05200345.pdf?arnumber=5200345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T18:41:02Z","timestamp":1739299262000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5200345\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":33,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2009.2016570","relation":{},"ISSN":["1941-0026","1089-778X"],"issn-type":[{"type":"electronic","value":"1941-0026"},{"type":"print","value":"1089-778X"}],"subject":[],"published":{"date-parts":[[2009,10]]}}}