{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:39:34Z","timestamp":1762101574213},"reference-count":35,"publisher":"Elsevier","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995]]},"DOI":"10.1016\/b978-1-55860-356-1.50016-9","type":"book-chapter","created":{"date-parts":[[2014,6,30]],"date-time":"2014-06-30T08:24:15Z","timestamp":1404116655000},"page":"243-269","source":"Crossref","is-referenced-by-count":44,"title":["Genetic Algorithm Difficulty and the Modality of Fitness Landscapes"],"prefix":"10.1016","author":[{"given":"Jeffrey","family":"Horn","sequence":"first","affiliation":[]},{"given":"David E.","family":"Goldberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib1","unstructured":"Ackley, D. H. (1985). A connectionist algorithm for genetic search. In J. J. Grefenstette (Ed.), Proceedings of an International Conference on Genetic Algorithms (pp. 121\u2013135). Hillsdale, NJ: Lawrence Erlbaum Associates, Publishers."},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib2","series-title":"A connectionist machine for genetic hillclimbing.","author":"Ackley","year":"1987"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib3","series-title":"Genetic algorithms and simulated annealing","first-page":"170","article-title":"An empirical study of bit vector function optimization","author":"Ackley","year":"1987"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib4","unstructured":"Bethke, A. D. (1981). Genetic algorithms as function optimizers. (Doctoral dissertation, University of Michigan at Ann Arbor). Dissertation Abstracts International, 41(9), 3503B. (University Microfilms No. 81\u201306101)."},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib5","series-title":"Sphere packings, lattices, and groups","author":"Conway","year":"1993"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib6","series-title":"Foundations of genetic algorithms 2","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-08-094832-4.50012-X","article-title":"Analyzing deception in trap functions","author":"Deb","year":"1993"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01531277","article-title":"Sufficient conditions for deceptive and easy binary functions","volume":"10","author":"Deb","year":"1994","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib8","first-page":"131","article-title":"Multimodal deceptive functions","volume":"7","author":"Deb","year":"1993","journal-title":"Complex Systems"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib9","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-1-55860-356-1.50016-9_bib10","series-title":"Genetic algorithms in search, optimization, and machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib11","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-1-55860-356-1.50016-9_bib12","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-1-55860-356-1.50016-9_bib13","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":"1991","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib14","first-page":"1","article-title":"Making genetic algorithms fly: a lesson from the Wright brothers","volume":"2","author":"Goldberg","year":"1993","journal-title":"Advanced Technology for Developers"},{"issue":"3","key":"10.1016\/B978-1-55860-356-1.50016-9_bib15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/175247.175259","article-title":"Genetic and evolutionary algorithms come of age","volume":"37","author":"Goldberg","year":"1994","journal-title":"Communications of the Association for Computing Machinery"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib16","first-page":"333","article-title":"Genetic algorithms, noise, and the sizing of populations","volume":"6","author":"Goldberg","year":"1992","journal-title":"Complex Systems"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib17","first-page":"37","article-title":"Massive multimodality, deception, and genetic algorithms","volume":"2","author":"Goldberg","year":"1992"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib18","unstructured":"Goldberg, D. E., Deb, K., & Korb, B. (1991). Don't worry, be messy. In R. K. Belew, & L. B. Booker (Ed.s), Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 24\u201330). San Mateo, CA: Morgan Kaufmann."},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib19","first-page":"266","article-title":"Genetic algorithms and the variance of fitness","volume":"5","author":"Goldberg","year":"1991","journal-title":"Complex Systems"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib20","first-page":"75","article-title":"Deception considered harmful","volume":"2","author":"Grefenstette","year":"1992"},{"issue":"4","key":"10.1016\/B978-1-55860-356-1.50016-9_bib21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0898-1221(88)90213-1","article-title":"A survey of the theory of hypercube graphs","volume":"15","author":"Harary","year":"1988","journal-title":"Computational Mathematical Applications"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib22","series-title":"Adaptation in natural and artificial systems","author":"Holland","year":"1992"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib23","unstructured":"Homaifar, A., Qi, X., & Foster, J. (1991). Analysis and design of a general GA deceptive problem. In R. K. Belew, & L. B. Booker (Ed.s), Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 196\u2013203). San Mateo, CA: Morgan Kaufmann."},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib24","series-title":"Lecture Notes in Computer Science: Vol. 866. Parallel Problem Solving From nature - PPSN III","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-58484-6_259","article-title":"Long path problems","author":"Horn","year":"1994"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib25","unstructured":"Jones, T., & Rawlins, G. J. E. (1993). Reverse hillclimbing, genetic algorithms and the busy beaver problem. In S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms (pp. 70\u201375). San Mateo, CA: Morgan Kaufmann."},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib26","series-title":"Decision making in genetic algorithms: a signal-to-noise perspective (IlliGAL Report No. 94004)","author":"Kargupta","year":"1994"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib27","series-title":"The Theory of Error Correcting Codes.","author":"MacWilliams","year":"1977"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib28","unstructured":"Mahfoud, S. W. (1993). Simple analytical models for genetic algorithms for multimodal function optimization. In S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms (p. 643). San Mateo, CA: Morgan Kaufmann."},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib29","unstructured":"Mitchell, M., Forrest, S., & Holland, J. H. (1991). The royal road for genetic algorithms: fitness landscapes and GA performance. In J. Varela, & P. Bourgine (Ed.s), Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life (pp. 245\u2013254). Cambridge, MA: The MIT Press."},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib30","unstructured":"Mitchell, M., & Holland, J. H. (1993). When will a genetic algorithm outperform a hill climbing? In S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms (p. 647). San Mateo, CA: Morgan Kaufmann."},{"issue":"5","key":"10.1016\/B978-1-55860-356-1.50016-9_bib31","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TIT.1974.1055267","article-title":"Difference-preserving codes","volume":"20","author":"Preparata","year":"1974","journal-title":"IEEE Transactions on Information Theory (IT)"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib32","series-title":"Signal, noise, and genetic algorithms (IlliGAL Report No. 91005)","author":"Rudnick","year":"1991"},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib33","series-title":"Foundations of Genetic Algorithms","doi-asserted-by":"crossref","first-page":"221","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-1-55860-356-1.50016-9_bib34","unstructured":"Wilson, S. W. (1991). GA-easy does not imply steepest-ascent optimizable. In R. K. Belew, & L. B. Booker (Ed.s), Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 85\u201389). San Mateo, CA: Morgan Kaufmann."},{"key":"10.1016\/B978-1-55860-356-1.50016-9_bib35","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1086\/284777","article-title":"Surfaces of selective value revisited","volume":"131","author":"Wright","year":"1988","journal-title":"American Naturalist"}],"container-title":["Foundations of Genetic Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558603561500169?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9781558603561500169?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,2]],"date-time":"2018-10-02T15:53:16Z","timestamp":1538495596000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9781558603561500169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1016\/b978-1-55860-356-1.50016-9","relation":{},"ISSN":["1081-6593"],"issn-type":[{"value":"1081-6593","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]}}}