{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T17:24:54Z","timestamp":1772558694736,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1016\/s0377-2217(99)00321-5","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"662-674","source":"Crossref","is-referenced-by-count":63,"title":["New stopping criterion for genetic algorithms"],"prefix":"10.1016","volume":"126","author":[{"given":"Haldun","family":"Aytug","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary J.","family":"Koehler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0377-2217(99)00321-5_BIB1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/ijoc.8.2.183","article-title":"Stopping criteria for finite length genetic algorithms","volume":"8","author":"Aytug","year":"1996","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"10.1016\/S0377-2217(99)00321-5_BIB2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0377-2217(96)00121-X","article-title":"A Markov chain analysis of general cardinality genetic algorithms with power of cardinality alphabets","volume":"96","author":"Aytug","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00321-5_BIB3","unstructured":"D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989"},{"key":"10.1016\/S0377-2217(99)00321-5_BIB4","doi-asserted-by":"crossref","unstructured":"D. Greenhalgh, S. Marshall, Convergence criteria for genetic algorithms, SIAM Journal on Computing, forthcoming","DOI":"10.1137\/S009753979732565X"},{"key":"10.1016\/S0377-2217(99)00321-5_BIB5","unstructured":"N.L. Johnson, A. Kotz, A.W. Kemp, Univariate Discrete Distributions, Wiley, New York, 1992"},{"key":"10.1016\/S0377-2217(99)00321-5_BIB6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1023\/A:1018928017332","article-title":"New directions in genetic algorithm theory","volume":"75","author":"Koehler","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(99)00321-5_BIB7","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1162\/evco.1997.5.4.439","article-title":"General cardinality genetic algorithms","volume":"5","author":"Koehler","year":"1997","journal-title":"Evolutionary Computation"},{"key":"10.1016\/S0377-2217(99)00321-5_BIB8","unstructured":"H. Minc, Nonnegative Matrices, Wiley, New York, 1988"},{"key":"10.1016\/S0377-2217(99)00321-5_BIB9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01530781","article-title":"Modeling genetic algorithms with Markov chains","volume":"5","author":"Nix","year":"1992","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/S0377-2217(99)00321-5_BIB10","unstructured":"M.D. Vose, Formalizing genetic algorithms, Proceedings of the IEEE Workshop on Genetic Algorithms, Neural Networks, and Simulated Annealing Applied to Signal and Image Processing, Glasgow, Scotland, May 1990"},{"issue":"4","key":"10.1016\/S0377-2217(99)00321-5_BIB11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1162\/evco.1996.4.4.395","article-title":"Logarithmic convergence of random heuristic search","volume":"4","author":"Vose","year":"1996","journal-title":"Evolutionary Computation"},{"issue":"1","key":"10.1016\/S0377-2217(99)00321-5_BIB12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems for optimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003215?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003215?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T13:52:33Z","timestamp":1556459553000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799003215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0377221799003215"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00321-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}