{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:40:37Z","timestamp":1787337637179,"version":"build-2736575974"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2000,1]]},"abstract":"<jats:p>In this paper we discuss convergence properties for genetic algorithms. By looking at the effect of mutation on convergence, we show that by running the genetic algorithm for a sufficiently long time we can guarantee convergence to a global optimum with any specified level of confidence. We obtain an upper bound for the number of iterations necessary to ensure this, which improves previous results. Our upper bound decreases as the population size increases. We produce examples to show that in some cases this upper bound is asymptotically optimal for large population sizes. The final section discusses implications of these results for optimal coding of genetic algorithms.<\/jats:p>","DOI":"10.1137\/s009753979732565x","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"269-282","source":"Crossref","is-referenced-by-count":106,"title":["Convergence Criteria for Genetic Algorithms"],"prefix":"10.1137","volume":"30","author":[{"given":"David","family":"Greenhalgh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Marshall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,27]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00121-X"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.2.183"},{"key":"R3","unstructured":"H. Aytug and G. J. Koehler (1999),\n                      A new stopping criterion for genetic algorithms\n                      , INFORMs J. Comput., submitted; also available online from http:\/\/www.cba.ufl.edu\/dis\/research.html."},{"key":"R4","unstructured":"L. Davis (1991),\n                      Handbook of Genetic Algorithms\n                      , Van Nostrand Reinhold, New York."},{"key":"R5","unstructured":"K. A. de Jong (1975),\n                      An Analysis of the Behaviour of a Class of Genetic Adaptive Systems\n                      , Ph.D. thesis, University of Michigan, Ann Arbor, MI."},{"key":"R6","unstructured":"D. E. Goldberg (1989),\n                      Genetic Algorithms in Search, Optimization and Machine Learning\n                      , Addison\u2013Wesley, Reading, MA."},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0923-5965(95)00033-X"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1997.5.4.439"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530781"},{"key":"R10","first-page":"175","volume":"18","author":"Salomon R.","year":"1997","journal-title":"Software\u2014Concepts and Tools"},{"key":"R11","first-page":"31","volume":"5","author":"Vose M. D.","year":"1991","journal-title":"Complex Systems","ISSN":"https:\/\/id.crossref.org\/issn\/0891-2513","issn-type":"print"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.4.347"},{"key":"R13","unstructured":"D. H. Wolpert and W. G. Macready (1995),\n                      No Free Lunch Theorems for Search\n                      , Tech. Rep. SFI\u2010TR\u201095\u201002\u2010010, Santa Fe Institute, Santa Fe, NM."},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1996.8.7.1341"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S009753979732565X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:22:24Z","timestamp":1787336544000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S009753979732565X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1137\/S009753979732565X"],"URL":"https:\/\/doi.org\/10.1137\/s009753979732565x","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}