{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:50:35Z","timestamp":1762390235605},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540473312"},{"type":"electronic","value":"9783540473329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11903697_65","type":"book-chapter","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:48:07Z","timestamp":1160581687000},"page":"513-520","source":"Crossref","is-referenced-by-count":12,"title":["A Time Complexity Analysis of ACO for Linear Functions"],"prefix":"10.1007","author":[{"given":"Zhifeng","family":"Hao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xili","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for Discrete Optimization. Massachusetts Institute of Technology, Artificial Life\u00a05, 137\u2013172 (1999)","journal-title":"Massachusetts Institute of Technology, Artificial Life"},{"issue":"1","key":"65_CR2","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"},{"issue":"8","key":"65_CR3","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. Future Gener. Comput. Syst.\u00a016(8), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"65_CR4","unstructured":"Gutjahr, W.J.: Ageneralized convergence result for the graph-based ant system metaheuristic. Tech. Report 99-09, Department of Statistics and Decision Support Systems, University of Vienna, Austria (1999)"},{"issue":"9","key":"65_CR5","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"W.J. Gutjahr","year":"2000","unstructured":"Gutjahr, W.J.: Agraph-based ant system and its convergence. Future Gen. Comput. Systems\u00a016(9), 873\u2013888 (2000)","journal-title":"Future Gen. Comput. Systems"},{"key":"65_CR6","doi-asserted-by":"publisher","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\u00a082, 145\u2013153 (2002)","journal-title":"Information Processing Letters"},{"issue":"4","key":"65_CR7","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/TEVC.2002.802444","volume":"6","author":"T. St\u00fctzle","year":"2002","unstructured":"St\u00fctzle, T., Dorigo, M.: A Short Convergence Proof for a Class of Ant Colony Optimization Algorithms. IEEE Transactions on Evolutionary Computation\u00a06(4), 358\u2013365 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"65_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"65_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M. Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theoretical Computer Science\u00a0344, 243\u2013278 (2005)","journal-title":"Theoretical Computer Science"},{"key":"65_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.ins.2003.08.018","volume":"160","author":"A. Badr","year":"2004","unstructured":"Badr, A., Fahmy, A.: A proof of convergence for Ant algorithms. Information Sciences\u00a0160, 267\u2013279 (2004)","journal-title":"Information Sciences"},{"key":"65_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-45724-0_31","volume-title":"Ant Algorithms","author":"S. Fidanova","year":"2002","unstructured":"Fidanova, S.: ACO Algorithm with Additional Reinforcement. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 292\u2013293. Springer, Heidelberg (2002)"},{"key":"65_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-25944-2_68","volume-title":"Computational Science - ICCS 2004","author":"S. Fidanova","year":"2004","unstructured":"Fidanova, S.: Convergence Proof for a Monte Carlo Method for Combinatorial Optimization Problems. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol.\u00a03039, pp. 523\u2013530. Springer, Heidelberg (2004)"},{"issue":"2","key":"65_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1162\/evco.1998.6.2.185","volume":"6","author":"S. Droste","year":"1998","unstructured":"Droste, S., Jansen, T., Wegener, I.: A rigorous complexity analysis of the (1+1)-evolutionary algorithms. Evolutionary Computation\u00a06(2), 185\u2013196 (1998)","journal-title":"Evolutionary Computation"},{"issue":"1-2","key":"65_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S. Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1)-evolutionary algorithms. Theoretical Computer Science\u00a0276(1-2), 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"key":"65_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J. He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing\u00a03, 21\u201335 (2004)","journal-title":"Natural Computing"},{"issue":"5","key":"65_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1109\/TEVC.2002.800886","volume":"6","author":"J. He","year":"2002","unstructured":"He, J., Yao, X.: From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Transactions on Evolutionary Computation\u00a06(5), 495\u2013511 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"65_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J. He","year":"2001","unstructured":"He, J., Yao, X.: Erratum to: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence\u00a0127, 57\u201385 (2001), Artificial Intelligence 140(1), 245\u2013248 (2002)","journal-title":"Artificial Intelligence"},{"key":"65_CR18","first-page":"440","volume-title":"Proc. Fifth Chinese Joint Conference on Artificial Intelligence","author":"J. He","year":"1998","unstructured":"He, J., Huang, H.: The computational time analysis of genetic algorithms. In: Proc. Fifth Chinese Joint Conference on Artificial Intelligence, pp. 440\u2013443. Xi\u2019an Jiaotong University Press, Xi\u2019an (1998)"},{"issue":"9","key":"65_CR19","first-page":"999","volume":"21","author":"J. He","year":"1999","unstructured":"He, J., Huang, H., Kang, L.: The computational time of genetic algorithms for fully deceptive problem. Chinese J. Comput.\u00a021(9), 999\u20131003 (1999)","journal-title":"Chinese J. Comput."},{"key":"65_CR20","doi-asserted-by":"crossref","unstructured":"He, J., Yao, X., Li, J.: A Comparative Study of Three Evolutionary Algorithms Incorporating Different Amounts of Domain Knowledge for Node Covering Problem. IEEE Transactions on systems, man, and cybernetics\u2014Part C: Applications and Reviews\u00a035(2) (May 2005)","DOI":"10.1109\/TSMCC.2004.841903"},{"issue":"1-2","key":"65_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0004-3702(02)00381-8","volume":"145","author":"J. He","year":"2003","unstructured":"He, J., Yao, X.: Towards an analytic framework for analyzing the computation time of evolutionary algorithms. Artificial Intelligence\u00a0145(1-2), 59\u201397 (2003)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11903697_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:56:53Z","timestamp":1605643013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11903697_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540473312","9783540473329"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11903697_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}