{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:07:44Z","timestamp":1725491264629},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540743767"},{"type":"electronic","value":"9783540743774"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74377-4_23","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T05:38:34Z","timestamp":1189575514000},"page":"209-219","source":"Crossref","is-referenced-by-count":0,"title":["About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space"],"prefix":"10.1007","author":[{"given":"Lixin","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingzhou","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.3233\/FI-1998-35123405","volume":"35","author":"G. Rudolph","year":"1998","unstructured":"Rudolph, G.: Finite Markov chain results in evolutionary computation: A tour d\u2019Horizon. Fundamenta Informaticae\u00a035, 67\u201389 (1998)","journal-title":"Fundamenta Informaticae"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(99)00089-4","volume":"229","author":"A.E. Eiben","year":"1999","unstructured":"Eiben, A.E., Rudolph, G.: Theory of evolutionary algorithms: A bird\u2019s eye view. Theoretical Computer Science\u00a0229, 3\u20139 (1999)","journal-title":"Theoretical Computer Science"},{"key":"23_CR3","unstructured":"B\u00e4ck, T.: The interaction of mutation rate, selection and self-adaption within a genetic algorithm. In: PPSN-II Conference Proceedings. pp. 85\u201394 (1992)"},{"key":"23_CR4","unstructured":"M\u00fchlenbein, H.: How genetic algorithms really works I: Mutation and hill-climbing. In: PPSN-II Conference Proceedings. pp. 15\u201325 (1992)"},{"key":"23_CR5","unstructured":"Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Ph.D. Thesis, Verlag Dr. Kovac\u0306, Hamburg (1997)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J. Garnier","year":"1999","unstructured":"Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolutionary Computation\u00a07, 173\u2013203 (1999)","journal-title":"Evolutionary Computation"},{"key":"23_CR7","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 algorithm for linear functions with Boolean inputs. Evolutionary Computation\u00a06, 185\u2013196 (1998)","journal-title":"Evolutionary Computation"},{"key":"23_CR8","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, 51\u201381 (2002)","journal-title":"Theoretical Computer Science"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1162\/evco.1996.4.2.195","volume":"4","author":"G. Rudolph","year":"1996","unstructured":"Rudolph, G.: How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation\u00a04, 195\u2013205 (1996)","journal-title":"Evolutionary Computation"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/4235.843492","volume":"4","author":"J. Garnier","year":"2000","unstructured":"Garnier, J., Kallel, L.: Statistical distribution of the convergence time of evolutionary algorithms for long path problems. IEEE Trans. on Evolutionary Computation\u00a04, 16\u201330 (2000)","journal-title":"IEEE Trans. on Evolutionary Computation"},{"key":"23_CR11","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.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence\u00a0127, 57\u201385 (2001)","journal-title":"Artificial Intelligence"},{"key":"23_CR12","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 Trans. on Evolutionary computation\u00a06, 495\u2013511 (2002)","journal-title":"IEEE Trans. on Evolutionary computation"},{"key":"23_CR13","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, 59\u201397 (2003)","journal-title":"Artificial Intelligence"},{"key":"23_CR14","unstructured":"He, J., Yao, X.: An analysis of evolutionary algorithms for finding approximation solutions to hard optimisation problems. In: Proc. of CEC pp. 2004\u20132010 (2003)"},{"key":"23_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"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/BF02944746","volume":"19","author":"J. He","year":"2004","unstructured":"He, J., Yao, X.: Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching. Journal of Computer science & Technology\u00a019, 450\u2013458 (2004)","journal-title":"Journal of Computer science & Technology"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01530781","volume":"5","author":"A.E. Nix","year":"1992","unstructured":"Nix, A.E., Vose, M.D.: Modeling genetic algorithms with Markov chains. Ann. of Math. & Artificial Intelligence\u00a05, 79\u201388 (1992)","journal-title":"Ann. of Math. & Artificial Intelligence"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1109\/21.370197","volume":"25","author":"J. Suzuki","year":"1995","unstructured":"Suzuki, J.: A Markov chain analysis on simple genetic algorithms. IEEE Trans. on Systems Man & Cybernetics\u00a025, 655\u2013659 (1995)","journal-title":"IEEE Trans. on Systems Man & Cybernetics"},{"key":"23_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","volume-title":"The Simple Genetic Algorithms: Foundations and Theory","author":"M.D. Vose","year":"1999","unstructured":"Vose, M.D.: The Simple Genetic Algorithms: Foundations and Theory. MIT Press, Cambridge (1999)"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/42282.46160","volume":"35","author":"G.H. Sasaki","year":"1988","unstructured":"Sasaki, G.H., Hajek, B.: The time complexity of maximum matching by simulated annealing. J. of the ACM\u00a035, 387\u2013403 (1988)","journal-title":"J. of the ACM"},{"key":"23_CR21","volume-title":"Markov Chains and Stochastic Stability","author":"S.P. Meyn","year":"1996","unstructured":"Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability, 3rd edn. Springer, New York (1996)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74377-4_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T03:50:42Z","timestamp":1684036242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74377-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540743767","9783540743774"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74377-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}