{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T22:56:56Z","timestamp":1768777016198,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540201038","type":"print"},{"value":"9783540398165","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39816-5_2","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T02:01:32Z","timestamp":1277690492000},"page":"10-25","source":"Crossref","is-referenced-by-count":50,"title":["A Converging ACO Algorithm for Stochastic Combinatorial Optimization"],"prefix":"10.1007","author":[{"given":"Walter J.","family":"Gutjahr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-662-04448-3_11","volume-title":"Theoretical Aspects of Evolutionary Computing","author":"D.V. Arnold","year":"2001","unstructured":"Arnold, D.V.: Evolution strategies in noisy environments - a survey of existing work. In: Kallel, L., Nauts, B., Rogers, A. (eds.) Theoretical Aspects of Evolutionary Computing, pp. 239\u2013250. Springer, Heidelberg (2001)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bakuli, D.L., MacGregor Smith, J.: Resource allocation in state-dependent emergency evacuation networks. European J. of Op. Res. 89, 543\u2013555 (1996)","DOI":"10.1016\/0377-2217(94)00230-4"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/opre.44.2.286","volume":"44","author":"D. Bertsimas","year":"1996","unstructured":"Bertsimas, D., Simchi-Levi, D.: A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Operations Research 44, 286\u2013304 (1996)","journal-title":"Operations Research"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bianchi, L., Gambardella, L.M., Dorigo, M.: Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic. In: Proc. ANTS 2002, 3rd Int. Workshop on Ant Algorithms, pp. 177\u2013187 (2002)","DOI":"10.1007\/3-540-45724-0_15"},{"issue":"1","key":"2_CR5","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: A new rank\u2013based version of the Ant System: A computational study. Central European Journal for Operations Research 7 (1), 25\u201338 (1999)","journal-title":"Central European Journal for Operations Research"},{"key":"2_CR6","first-page":"11","volume-title":"New Ideas in Optimization","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G.: The Ant Colony Optimization metaheuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11\u201332. McGraw\u2013Hill, New York (1999)"},{"key":"2_CR7","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: An autocatalytic optimization process., Technical Report 91\u2013016, Dept. of Electronics, Politecnico di Milano, Italy (1991)"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15, 483\u2013495 (1990)","journal-title":"Mathematics of Operations Research"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02031702","volume":"56","author":"A. Futschik","year":"1995","unstructured":"Futschik, A., Pflug, C.: Confidence sets for discrete stochastic optimization. Annals of Operations Research 56, 95\u2013108 (1995)","journal-title":"Annals of Operations Research"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Gambardella, L.M., Dorigo, M.: Ant-Q: A Reinforcement Learning approach to the traveling salesman problem. In: Proc. of ML 1995, Twelfth Intern. Conf. on Machine Learning, pp. 252\u2013260 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Gelfand, S.B., Mitter, S.K.: Analysis of Simulated Annealing for Optimization. In: Proc. 24th IEEE Conf. on Decision and Control, pp. 779\u2013786 (1985)","DOI":"10.21236\/ADA170174"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"W.J. Gutjahr","year":"2000","unstructured":"Gutjahr, W.J.: A graph\u2013based Ant System and its convergence., Future Generation Computer Systems 16, 873\u2013888 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0020-0190(01)00258-7","volume":"82","author":"W.J. Gutjahr","year":"2002","unstructured":"Gutjahr, W.J.: ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters 82, pp. 145\u2013153 (2002)","journal-title":"Information Processing Letters"},{"key":"2_CR14","unstructured":"Gutjahr, W.J.: A generalized convergence result for the Graph\u2013based Ant System. Accepted for publication in: Probability in the Engineering and Informational Sciences"},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00229298","volume":"8","author":"W.J. Gutjahr","year":"1996","unstructured":"Gutjahr, W.J., Pflug, G.: Simulated annealing for noisy cost functions. J. of Global Optimization 8, 1\u201313 (1996)","journal-title":"J. of Global Optimization"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Gutjahr, W.J., Strauss, Ch, Wagner, E.: A stochastic branch-and-bound approach to activity crashing in project management. INFORMS J. on Computing 12, 125\u2013135 (2000)","DOI":"10.1287\/ijoc.12.2.125.11894"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Hajek, B.: Cooling schedules for optimal annealing. Mathematics of OR 13, 311\u2013329 (1988)","DOI":"10.1287\/moor.13.2.311"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/0022-4146.00100","volume":"38","author":"V. Marianov","year":"1998","unstructured":"Marianov, V., Serra, D.: Probabilistic maximal covering location-allocation models for congested systems. J. of Regional Science 38, 401\u2013424 (1998)","journal-title":"J. of Regional Science"},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.46.3.381","volume":"46","author":"V.I. Norkin","year":"1998","unstructured":"Norkin, V.I., Ermoliev, Y.M., Ruszczynski, A.: On optimal allocation of indivisibles under uncertainty. Operations Research 46, 381\u2013395 (1998)","journal-title":"Operations Research"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.H.: The MAX-MIN Ant system and local search for the travelling salesman problem. In: Baeck, T., Michalewicz, Z., Yao, X. (eds.) Proc. ICEC 1997 (Int. Conf. on Evolutionary Computation), pp. 309\u2013314 (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX-MIN Ant System. Future Generation Computer Systems 16, 889\u2013914 (2000)","DOI":"10.1016\/S0167-739X(00)00043-1"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39816-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T08:30:57Z","timestamp":1740213057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39816-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201038","9783540398165"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39816-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}