{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:14:41Z","timestamp":1761894881678},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"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. Syst., Man, Cybern. B"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1109\/tsmcb.2009.2012867","type":"journal-article","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T02:26:08Z","timestamp":1240021568000},"page":"910-923","source":"Crossref","is-referenced-by-count":31,"title":["A Pheromone-Rate-Based Analysis on the Convergence Time of ACO Algorithm"],"prefix":"10.1109","volume":"39","author":[{"family":"Han Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Chun-Guo Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Zhi-Feng Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/COGINF.2006.365579","article-title":"The improved ant colony algorithm based on immunity system genetic algorithm and application","volume":"2","author":"Zhang","year":"2006","journal-title":"Proc. 5th IEEE Int. Conf. Cognitive Inform."},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2006.871151"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1162\/106454699568728"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","author":"Dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"8","first-page":"99","author":"Gutjahr","year":"1999","journal-title":"A generalized convergence result for the graph-based ant system metaheuristic"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00044-3"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00258-7"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.802444"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.020"},{"key":"13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.ins.2003.08.018","article-title":"A proof of convergence for ant algorithms","volume":"160","author":"Badr","year":"2004","journal-title":"Inform. Sci."},{"key":"14","first-page":"618","volume":"4288, Lecture","author":"Neumann","year":"2006","journal-title":"Runtime Analysis of a Simple Ant Colony Optimization Algorithm"},{"key":"15","first-page":"513","volume":"4247, Lecture","author":"Hao","year":"2006","journal-title":"A Time Complexity Analysis of ACO for Linear Functions"},{"key":"16","first-page":"1343","article-title":"The convergence speed of Ant Colony Optimization","volume":"30","author":"Huang","year":"2007","journal-title":"Chin. J. Comput."},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/72.265964"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1999.7.2.173"},{"key":"19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1162\/evco.1998.6.2.185","article-title":"A rigorous complexity analysis of the (1","volume":"6","author":"Droste","year":"1998","journal-title":"Evol. Comput."},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/4235.843492"},{"key":"22","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1162\/evco.1996.4.2.195","article-title":"How mutation and selection solve long-path problems in polynomial expected time","volume":"4","author":"Rudolph","year":"1996","journal-title":"Evol. Comput."},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.800886"},{"key":"24","first-page":"999","article-title":"The computational time of genetic algorithms for fully deceptive problem","volume":"21","author":"He","year":"1999","journal-title":"Chin. J. Comput."},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2004.841903"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.4.435"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.888929"},{"key":"29","first-page":"651","article-title":"Runtime analysis of the (u","author":"Witt","year":"2006","journal-title":"Proc. 8th Annu. Conf. Genetic Evol. Comput."},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299918"},{"key":"31","first-page":"44","article-title":"Worse-case and average-case approximations by simple randomized search heuristics","volume":"3404, Lecture","author":"Witt","year":"2005","journal-title":"Proc. 22nd Annu. Symp. Theor. Aspects Comput. Sci."},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1330957"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9004-x"},{"key":"34","first-page":"713","article-title":"Randomized local search, evolutionary algorithms and the minimum spanning tree problem","volume":"3102, Lecture","author":"Neumann","year":"2004","journal-title":"Proc. Genetic Evol. Comput. Conf."},{"key":"35","first-page":"555","article-title":"A new approach to estimating the expected first hitting time of evolutionary algorithms","author":"Yu","year":"2006","journal-title":"Proc. 21st Nat. Conf. Artif. Intell. AAAI"},{"key":"36","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2014A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"key":"37","author":"Huang","year":"2008","journal-title":"A relation-and-ordering-based analysis for convergence and convergence time of evolutionary algorithm"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/3477\/4967998\/04815524.pdf?arnumber=4815524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:43:51Z","timestamp":1633913031000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4815524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":37,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tsmcb.2009.2012867","relation":{},"ISSN":["1083-4419"],"issn-type":[{"value":"1083-4419","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}