{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T16:09:55Z","timestamp":1744906195090},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291234"},{"type":"electronic","value":"9783642291241"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29124-1_19","type":"book-chapter","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T13:24:42Z","timestamp":1332509082000},"page":"218-229","source":"Crossref","is-referenced-by-count":14,"title":["Pure Strategy or Mixed Strategy?"],"prefix":"10.1007","author":[{"given":"Jun","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feidun","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongbin","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Fogel, D., Michalewicz, Z.: Handbook of Evolutionary Computation. Oxford Univ. Press (1997)","DOI":"10.1201\/9781420050387"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Grosan, C., Abraham, A., Ishibuchi, H.: Hybrid Evolutionary Algorithms. Springer (2007)","DOI":"10.1007\/978-3-540-73297-6"},{"key":"19_CR3","unstructured":"Dutta, P.: Strategies and Games: Theory and Practice. MIT Press (1999)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/11539902_33","volume-title":"Advances in Natural Computation","author":"J. He","year":"2005","unstructured":"He, J., Yao, X.: A Game-Theoretic Approach for Designing Mixed Mutation Strategies. In: Wang, L., Chen, K., Ong, Y.S. (eds.) ICNC 2005, Part III. LNCS, vol.\u00a03612, pp. 279\u2013288. Springer, Heidelberg (2005)"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.ins.2006.07.014","volume":"177","author":"H. Dong","year":"2007","unstructured":"Dong, H., He, J., Huang, H., Hou, W.: Evolutionary programming using a mixed mutation strategy. Information Sciences\u00a0177(1), 312\u2013327 (2007)","journal-title":"Information Sciences"},{"key":"19_CR6","first-page":"350","volume-title":"Proceedings of 2010 IEEE Congress on Evolutionary Computation","author":"L. Shen","year":"2010","unstructured":"Shen, L., He, J.: A mixed strategy for evolutionary programming based on local fitness landscape. In: Proceedings of 2010 IEEE Congress on Evolutionary Computation, pp. 350\u2013357. IEEE Press, Barcelona (July 2010)"},{"key":"19_CR7","unstructured":"Varga, R.: Matrix Iterative Analysis. Springer (2009)"},{"key":"19_CR8","first-page":"1108","volume":"arXiv","author":"J. He","year":"2011","unstructured":"He, J., Chen, T.: Population scalability analysis of abstract population-based random search: Spectral radius. Arxiv preprint arXiv:1108.4531 (2011)","journal-title":"Arxiv preprint"},{"key":"19_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structure = Evolution Program","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structure = Evolution Program. Springer, New York (1996)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-74581-5_11","volume-title":"Advances in Computation and Intelligence","author":"J. He","year":"2007","unstructured":"He, J., Zhou, Y.: A Comparison of GAs Using Penalizing Infeasible Solutions and Repairing Infeasible Solutions on Average Capacity Knapsack. In: Kang, L., Liu, Y., Zeng, S. (eds.) ISICA 2007. LNCS, vol.\u00a04683, pp. 100\u2013109. Springer, Heidelberg (2007)"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G. Rudolph","year":"1994","unstructured":"Rudolph, G.: Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks\u00a05(1), 96\u2013101 (1994)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"1-2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(99)00091-2","volume":"229","author":"J. He","year":"1999","unstructured":"He, J., Kang, L.: On the convergence rate of genetic algorithms. Theoretical Computer Science\u00a0229(1-2), 23\u201339 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"19_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 analysing the computation time of evolutionary algorithms. Artificial Intelligence\u00a0145(1-2), 59\u201397 (2003)","journal-title":"Artificial Intelligence"},{"key":"19_CR14","volume-title":"Finite Markov Chain and their Applications","author":"M. Iosifescu","year":"1980","unstructured":"Iosifescu, M.: Finite Markov Chain and their Applications. Wiley, Chichester (1980)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29124-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:39:55Z","timestamp":1578537595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29124-1_19"}},"subtitle":["An Initial Comparison of Their Asymptotic Convergence Rate and Asymptotic Hitting Time"],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291234","9783642291241"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29124-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}