{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T12:46:50Z","timestamp":1745326010022},"reference-count":35,"publisher":"Elsevier","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1016\/b978-0-08-094832-4.50011-8","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:16:56Z","timestamp":1404173816000},"page":"75-91","source":"Crossref","is-referenced-by-count":24,"title":["Deception Considered Harmful* *With apologies to Edsger Dijkstra (Dijkstra, 1968)."],"prefix":"10.1016","author":[{"given":"John J.","family":"Grefenstette","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib1","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-08-050684-5.50018-5","article-title":"Isomorphisms of genetic algorithms","author":"Battle","year":"1991"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib2","unstructured":"Bethke, A. D. (1981). Genetic algorithms as function optimizers. Doctoral dissertation, University of Michigan."},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib3","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-08-050684-5.50004-5","article-title":"The nonuniform Walsh-schema transform","author":"Bridges","year":"1991"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib4","unstructured":"Das, R. and D. L. Whitley (1991). The only challenging problems are deceptive. Proceedings of the Fourth International Conference of Genetic Algorithms (pp. 116\u2013173). San Mateo, CA: Morgan Kaufmann."},{"issue":"4","key":"10.1016\/B978-0-08-094832-4.50011-8_bib5","first-page":"369","article-title":"Epistasis variance: suitability of a representation to genetic algorithms","volume":"4","author":"Davidor","year":"1990","journal-title":"Complex Systems"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib6","unstructured":"De Jong, K. A. (1975). Analysis of the behavior of a class of genetic adaptive systems. Doctoral dissertation, Department of Computer and Communications Sciences, University of Michigan, Ann Arbor."},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib7","series-title":"Foundations of Genetic Algorithm 2","article-title":"Genetic algorithms are NOT function optimizers","author":"De Jong","year":"1992"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib8","series-title":"Foundations of Genetic Algorithms 2","article-title":"Analysing deception in trap functions","author":"Deb","year":"1992"},{"issue":"3","key":"10.1016\/B978-0-08-094832-4.50011-8_bib9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/362929.362947","article-title":"Go to statement considered harmful","volume":"11","author":"Dijkstra","year":"1968","journal-title":"CACM"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib10","series-title":"Genetic algorithms and simulated annealing","first-page":"74","article-title":"Simple genetic algorithms and the minimal deceptive problem","author":"Goldberg","year":"1987"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib11","series-title":"Genetic algorithms in search, optimization, and machine learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib12","first-page":"129","article-title":"Genetic algorithms and Walsh functions: Part I, a gentle introduction","volume":"3","author":"Goldberg","year":"1989","journal-title":"Complex Systems"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib13","first-page":"153","article-title":"Genetic algorithms and Walsh functions: Part II, deception and its analysis","volume":"3","author":"Goldberg","year":"1989","journal-title":"Complex Systems"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib14","first-page":"139","article-title":"Real-coded genetic algorithms, virtual alphabets, and blocking","volume":"5","author":"Goldberg","year":"1991","journal-title":"Complex Systems"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF01530779","article-title":"Construction of high-order deceptive functions using low-order Walsh coefficients","volume":"5","author":"Goldberg","year":"1992","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib16","first-page":"415","article-title":"Messy genetic algorithms revisited: Studies in mixed size and scale","volume":"4","author":"Goldberg","year":"1990","journal-title":"Complex Systems"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib17","unstructured":"Goldberg, D. E., K. Deb and B. Korb (1991). Don't worry, be messy. Proceedings of the Fourth International Conference of Genetic Algorithms (pp. 24\u201330). San Mateo, CA: Morgan Kaufmann."},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib18","series-title":"Foundations of Genetic Algorithms 2","article-title":"Accounting for noise in the sizing of populations","author":"Goldberg","year":"1992"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib19","first-page":"493","article-title":"Messy genetic algorithms: Motivation, analysis and first results","volume":"3","author":"Goldberg","year":"1989","journal-title":"Complex Systems"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib20","first-page":"265","article-title":"Genetic algorithms and the variance of fitness","volume":"2","author":"Goldberg","year":"1988","journal-title":"Complex Systems"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib21","article-title":"Genetic algorithms and their applications","volume":"21","author":"Grefenstette","year":"1990"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib22","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-08-050684-5.50019-7","article-title":"Conditions for implicit parallelism","author":"Grefenstette","year":"1991"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib23","unstructured":"Grefenstette, J. J. and J. E. Baker (1989). How genetic algorithms work: An critical look at implicit parallelism. Proceedings of the Third International Conference of Genetic Algorithms (pp. 20\u201327). San Mateo, CA: Morgan Kaufmann."},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib24","series-title":"Adaptation in natural and artificial systems","author":"Holland","year":"1975"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib25","unstructured":"Homaifar, A., X. Qi and J. Fost (1991). Analysis and design of a general GA deceptive problem. Proceedings of the Fourth International Conference of Genetic Algorithms (pp. 196\u2013203). San Mateo, CA: Morgan Kaufmann."},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib26","first-page":"4","article-title":"Representational issues in genetic algorithms","author":"Liepins","year":"1990","journal-title":"J. Exp. Theor. Artificial Intelligence"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib27","series-title":"Foundations of Genetic Algorithms","article-title":"Deceptiveness and genetic algorithm dynamics","author":"Liepins","year":"1991"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib28","unstructured":"Mason, A. J. (1991). Partition coefficients, static deception and deceptive problems for non-binary alphabets. Proceedings of the Fourth International Conference of Genetic Algorithms (pp. 210\u2013214). San Mateo, CA: Morgan Kaufmann."},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib29","doi-asserted-by":"crossref","unstructured":"S. Forrest and M. Mitchell (1993). What makes a problem hard for a genetic algorithms? Some anomalous results and their explanation. To appear in Machine Learning.","DOI":"10.1023\/A:1022626114466"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib30","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\/B978-0-08-094832-4.50011-8_bib31","series-title":"Signal, noise, and genetic algorithms","author":"Rudnick","year":"1991"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib32","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-08-050684-5.50022-7","article-title":"An analysis of multi-point crossover","author":"Spears","year":"1991"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib33","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-08-050684-5.50017-3","article-title":"Fundamental principles of deception in genetic search","author":"Whitley","year":"1991"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib34","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01530780","article-title":"Deception, dominance and implicit parallelism in genetic search","volume":"5","author":"Whitley","year":"1992","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/B978-0-08-094832-4.50011-8_bib35","unstructured":"Wilson, S. W. (1991). GA-easy does not imply steepest-ascent optimizable Proceedings of the Fourth International Conference of Genetic Algorithms (pp. 85\u201389). San Mateo, CA: Morgan Kaufmann."}],"container-title":["Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080948324500118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080948324500118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T09:25:24Z","timestamp":1538472324000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780080948324500118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1016\/b978-0-08-094832-4.50011-8","relation":{},"ISSN":["1081-6593"],"issn-type":[{"value":"1081-6593","type":"print"}],"subject":[],"published":{"date-parts":[[1993]]}}}