{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:57Z","timestamp":1725536877828},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037504"},{"type":"electronic","value":"9783642037511"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03751-1_6","type":"book-chapter","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T05:27:42Z","timestamp":1251782862000},"page":"76-91","source":"Crossref","is-referenced-by-count":12,"title":["Running Time Analysis of ACO Systems for\u00a0Shortest\u00a0Path\u00a0Problems"],"prefix":"10.1007","author":[{"given":"Christian","family":"Horoba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Sudholt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR2","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: An autocatalytic optimizing process. Technical Report 91-016 Revised, Politecnico di Milano (1991)"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","volume":"9","author":"G. Caro Di","year":"1998","unstructured":"Di Caro, G., Dorigo, M.: AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research\u00a09, 317\u2013365 (1998)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1017\/S0269964803174086","volume":"17","author":"W.J. Gutjahr","year":"2003","unstructured":"Gutjahr, W.J.: A generalized convergence result for the graph-based ant system metaheuristic. Probability in the Engineering and Informational Sciences\u00a017, 545\u2013569 (2003)","journal-title":"Probability in the Engineering and Informational Sciences"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1162\/106365602760234090","volume":"10","author":"D. Merkle","year":"2002","unstructured":"Merkle, D., Middendorf, M.: Modelling the dynamics of Ant Colony Optimization algorithms. Evolutionary Computation\u00a010(3), 235\u2013262 (2002)","journal-title":"Evolutionary Computation"},{"issue":"9","key":"6_CR7","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1016\/j.cor.2006.12.017","volume":"35","author":"W.J. Gutjahr","year":"2008","unstructured":"Gutjahr, W.J.: First steps to the runtime complexity analysis of ant colony optimization. Computers and Operations Research\u00a035(9), 2711\u20132727 (2008)","journal-title":"Computers and Operations Research"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/11940128_62","volume-title":"Algorithms and Computation","author":"F. Neumann","year":"2006","unstructured":"Neumann, F., Witt, C.: Runtime analysis of a simple ant colony optimization algorithm. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 618\u2013627. Springer, Heidelberg (2006)"},{"key":"6_CR9","first-page":"33","volume-title":"Proc. of GECCO\u00a02007","author":"B. Doerr","year":"2007","unstructured":"Doerr, B., Neumann, F., Sudholt, D., Witt, C.: On the runtime analysis of the 1-ANT ACO algorithm. In: Proc. of GECCO\u00a02007, pp. 33\u201340. ACM Press, New York (2007)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX-MIN ant system. Journal of Future Generation Computer Systems\u00a016, 889\u2013914 (2000)","journal-title":"Journal of Future Generation Computer Systems"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s11009-007-9047-1","volume":"10","author":"W.J. Gutjahr","year":"2008","unstructured":"Gutjahr, W.J., Sebastiani, G.: Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability\u00a010, 409\u2013433 (2008)","journal-title":"Methodology and Computing in Applied Probability"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s11721-008-0023-3","volume":"3","author":"F. Neumann","year":"2009","unstructured":"Neumann, F., Sudholt, D., Witt, C.: Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence\u00a03(1), 35\u201368 (2009)","journal-title":"Swarm Intelligence"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-87527-7_12","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"F. Neumann","year":"2008","unstructured":"Neumann, F., Sudholt, D., Witt, C.: Rigorous analyses for the combination of ant\u00a0colony\u00a0optimization and local search. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., St\u00fctzle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol.\u00a05217, pp. 132\u2013143. Springer, Heidelberg (2008)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-92695-5_12","volume-title":"Learning and Intelligent Optimization","author":"F. Neumann","year":"2008","unstructured":"Neumann, F., Witt, C.: Ant colony optimization and the minimum spanning tree problem. In: Maniezzo, V., Battiti, R., Watson, J.-P. (eds.) LION 2007 II. LNCS, vol.\u00a05313, pp. 153\u2013166. Springer, Heidelberg (2008)"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ipl.2007.08.013","volume":"105","author":"N. Attiratanasunthron","year":"2008","unstructured":"Attiratanasunthron, N., Fakcharoenphol, J.: A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs. Information Processing Letters\u00a0105(3), 88\u201392 (2008)","journal-title":"Information Processing Letters"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1023\/B:JMMA.0000049379.14872.f5","volume":"3","author":"J. Scharnow","year":"2004","unstructured":"Scharnow, J., Tinnefeld, K., Wegener, I.: The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms\u00a03(4), 349\u2013366 (2004)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"6_CR17","first-page":"1890","volume-title":"Proc. of CEC\u00a02007","author":"B. Doerr","year":"2007","unstructured":"Doerr, B., Happ, E., Klein, C.: A tight analysis of the (1+1)-EA for the single source shortest path problem. In: Proc. of CEC\u00a02007, pp. 1890\u20131895. IEEE Press, Los Alamitos (2007)"},{"key":"6_CR18","first-page":"539","volume-title":"Proc. of GECCO\u00a02008","author":"B. Doerr","year":"2008","unstructured":"Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. In: Proc. of GECCO\u00a02008, pp. 539\u2013546. ACM Press, New York (2008)"},{"key":"6_CR19","first-page":"113","volume-title":"Proc. of FOGA\u00a02009","author":"C. Horoba","year":"2009","unstructured":"Horoba, C.: Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem. In: Proc. of FOGA\u00a02009, pp. 113\u2013120. ACM Press, New York (2009)"},{"key":"6_CR20","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"6_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03751-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T11:33:03Z","timestamp":1552131183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03751-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037504","9783642037511"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03751-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}