{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:57:15Z","timestamp":1761893835148},"reference-count":23,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"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":["Information Sciences"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0020-0255(03)00178-6","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T23:44:52Z","timestamp":1059695092000},"page":"253-269","source":"Crossref","is-referenced-by-count":45,"title":["An analysis of Gray versus binary encoding in genetic search"],"prefix":"10.1016","volume":"156","author":[{"given":"Uday K.","family":"Chakraborty","sequence":"first","affiliation":[]},{"given":"Cezary Z.","family":"Janikow","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(03)00178-6_BIB1","series-title":"A Connectionist Machine for Genetic Hillclimbing","author":"Ackley","year":"1997"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB2","doi-asserted-by":"crossref","unstructured":"R.A. Caruana, J.D. Schaffer, Representation and hidden bias: Gray vs. binary coding for genetic algorithms, in: Proceedings of 5th International Conference on Machine Learning, Morgan Kaufmann, Los Altos, CA, 1988, pp. 153\u2013161","DOI":"10.1016\/B978-0-934613-64-4.50021-9"},{"issue":"2","key":"10.1016\/S0020-0255(03)00178-6_BIB3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1162\/evco.1996.4.2.133","article-title":"Analysis of selection algorithms: A Markov chain approach","volume":"4","author":"Chakraborty","year":"1996","journal-title":"Evolutionary Computation"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB4","unstructured":"U.K. Chakraborty, D.G. Dastidar, Chromosomal encoding in genetic adaptive search, in: Proceedings of International Conference on Signals, Data and Systems, AMSE, vol. 2, 1991, pp. 191\u2013195"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1162\/evco.1993.1.3.269","article-title":"A Markov chain framework for the simple genetic algorithm","volume":"1","author":"Davis","year":"1993","journal-title":"Evolutionary Computation"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB6","unstructured":"K.A. De Jong, An analysis of the behavior of a class of genetic adaptive systems, Ph.D. Thesis, University of Michigan, Ann Arbor, MI, 1975"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB7","series-title":"The CHC adaptive search algorithm, Foundations of Genetic Algorithms\u2013\u2013I","author":"Eshelman","year":"1991"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB8","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1002\/j.1538-7305.1958.tb03887.x","article-title":"Gray Codes and Paths on the n-Cube","volume":"37","author":"Gilbert","year":"1958","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB9","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB10","series-title":"Proceedings of 2nd International Conference on Genetic Algorithms","first-page":"1","article-title":"Finite Markov chain analysis of genetic algorithms","author":"Goldberg","year":"1987"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB11","series-title":"Parallel Problem Solving from Nature","first-page":"4","article-title":"Global convergence of genetic algorithms: a Markov chain analysis","author":"Eiben","year":"1991"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB12","series-title":"Practical Genetic Algorithms","author":"Haupt","year":"1998"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB13","unstructured":"R.B. Hollstein, Artificial genetic adaptation in computer control systems, Ph.D. Thesis, University of Michigan, 1971"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB14","doi-asserted-by":"crossref","unstructured":"J. Horn, D.E. Goldberg, Genetic algorithm difficulty and the modality of fitness landscapes, FOGA-3, 1994, pp. 243\u2013269","DOI":"10.1016\/B978-1-55860-356-1.50016-9"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB15","series-title":"Finite Markov Chains","author":"Kemeny","year":"1960"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB16","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\/S0020-0255(03)00178-6_BIB17","unstructured":"S.B. Rana, L.D. Whitley, Bit representations with a twist, in: Proceedings of 7th ICGA, 1997, pp. 188\u2013195"},{"issue":"1\u20134","key":"10.1016\/S0020-0255(03)00178-6_BIB18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.3233\/FI-1998-35123405","article-title":"Finite Markov Chain Results in Evolutionary Computation: A Tour d\u2019Horizon","volume":"35","author":"Rudolph","year":"1998","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB19","unstructured":"J.D. Schaffer et al., A study of control parameters affecting online performance of genetic algorithms for function optimization, in: Proceedings of 3rd ICGA, Morgan Kaufmann, 1989"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB20","series-title":"Proceedings of Fifth International Conference on Genetic Algorithms","first-page":"146","article-title":"A Markov chain analysis on a genetic algorithm","author":"Suzuki","year":"1993"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB21","series-title":"Foundations of Genetic Algorithms\u2013\u20132","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/B978-0-08-094832-4.50010-6","article-title":"Modeling simple genetic algorithms","author":"Vose","year":"1993"},{"key":"10.1016\/S0020-0255(03)00178-6_BIB22","unstructured":"D. Whitley, A free lunch proof for Gray versus binary encodings, in: Proceedings of Genetic and Evolutionary Computation (GECCO-1999), 1999, pp. 726\u2013733"},{"issue":"1","key":"10.1016\/S0020-0255(03)00178-6_BIB23","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":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025503001786?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025503001786?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T21:20:43Z","timestamp":1585084843000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025503001786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":23,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0020025503001786"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(03)00178-6","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}