{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T13:41:34Z","timestamp":1772458894468,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0020-0190(01)00258-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"145-153","source":"Crossref","is-referenced-by-count":213,"title":["ACO algorithms with guaranteed convergence to the optimal solution"],"prefix":"10.1016","volume":"82","author":[{"given":"Walter J.","family":"Gutjahr","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00258-7_BIB001","series-title":"Simulated Annealing and Boltzmann Machines","author":"Aarts","year":"1989"},{"issue":"1","key":"10.1016\/S0020-0190(01)00258-7_BIB002","first-page":"25","article-title":"A new rank-based version of the Ant System: A computational study","volume":"7","author":"Bullnheimer","year":"1999","journal-title":"Central European J. Oper. Res."},{"key":"10.1016\/S0020-0190(01)00258-7_BIB003","series-title":"Optimization, learning and natural algorithms, PhD Thesis","author":"Dorigo","year":"1992"},{"issue":"2","key":"10.1016\/S0020-0190(01)00258-7_BIB004","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","article-title":"Ant algorithms for discrete optimization","volume":"5","author":"Dorigo","year":"1999","journal-title":"Artificial Life"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB005","series-title":"New Ideas in Optimization","first-page":"11","article-title":"The Ant Colony Optimization metaheuristic","author":"Dorigo","year":"1999"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB006","series-title":"The Ant System: An autocatalytic optimization process, Technical Report 91-016","author":"Dorigo","year":"1991"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB007","doi-asserted-by":"crossref","unstructured":"S. Droste, T. Jansen, I. Wegener, On the analysis of the (1+1) evolutionary algorithm, Theoret. Comput. Sci., to appear","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB008","series-title":"Discrete Stochastic Processes","author":"Gallager","year":"1996"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB009","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","article-title":"A graph-based Ant System and its convergence","volume":"16","author":"Gutjahr","year":"2000","journal-title":"Future Generation Comput. Systems"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB010","series-title":"A generalized convergence result for the Graph-based Ant System, Technical Report 99-09","author":"Gutjahr","year":"1999"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB011","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1988","journal-title":"Math. of OR"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB012","series-title":"Non-negative Matrices and Markov Chains","author":"Seneta","year":"1981"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB013","series-title":"MAX-MIN Ant System for the quadratic assignment problem, Technical Report AIDA-97-4","author":"St\u00fctzle","year":"1997"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB014","series-title":"A short convergence proof for a class of ACO algorithms, Technical Report IRIDIA\/2000-35","author":"St\u00fctzle","year":"2000"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB015","series-title":"Proc. ICEC'97 (Internat. Conf. on Evolutionary Computation)","first-page":"309","article-title":"The MAX-MIN Ant system and local search for the travelling salesman problem","author":"St\u00fctzle","year":"1997"},{"key":"10.1016\/S0020-0190(01)00258-7_BIB016","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX-MIN Ant System","volume":"16","author":"St\u00fctzle","year":"2000","journal-title":"Future Generation Comput. Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002587?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002587?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:52:35Z","timestamp":1556776355000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002587"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00258-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}