{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:50:26Z","timestamp":1762390226398,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540389903"},{"type":"electronic","value":"9783540389910"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_80","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T18:55:37Z","timestamp":1160074537000},"page":"788-797","source":"Crossref","is-referenced-by-count":12,"title":["Performance of Evolutionary Algorithms on Random Decomposable Problems"],"prefix":"10.1007","author":[{"given":"Martin","family":"Pelikan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kumara","family":"Sastry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin V.","family":"Butz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David E.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"80_CR1","unstructured":"Ackley, D.H.: An empirical study of bit vector function optimization. Genetic Algorithms and Simulated Annealing, 170\u2013204 (1987)"},{"key":"80_CR2","unstructured":"Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. IlliGAL Report No. 91009, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL (1991)"},{"key":"80_CR3","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 1991), pp. 331\u2013337 (1991)"},{"key":"80_CR4","unstructured":"Santarelli, S., Goldberg, D.E., Yu, T.L.: Optimization of a constrained feed network for an antenna array using simple and competent genetic algorithm techniques. In: Proceedings of the Workshop Military and Security Application of Evolutionary Computation (MSAEC 2004) (2004)"},{"key":"80_CR5","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1088\/0305-4470\/15\/2\/033","volume":"15","author":"F. Barahona","year":"1982","unstructured":"Barahona, F., Maynard, R., Rammal, R., Uhry, J.: Morphology of ground states of a two dimensional frustration model. J. Phys. A\u00a015, 673 (1982)","journal-title":"J. Phys. A"},{"key":"80_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C.H. Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The Euclidean travelling salesman problem is NP-complete. Theoretical Computer Science\u00a04, 237\u2013244 (1977)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"80_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1162\/1063656053583423","volume":"13","author":"Y. Gao","year":"2005","unstructured":"Gao, Y., Culberson, J.: Space complexity of EDA. Evolutionary Computation\u00a013(1), 125\u2013143 (2005)","journal-title":"Evolutionary Computation"},{"key":"80_CR8","doi-asserted-by":"crossref","unstructured":"Gao, Y., Culberson, J.: On the treewidth of NK landscapes. In: Genetic and Evolutionary Computation Conference (GECCO 2003), vol.\u00a0II, pp. 948\u2013954 (2003)","DOI":"10.1007\/3-540-45105-6_106"},{"issue":"10","key":"80_CR9","doi-asserted-by":"publisher","first-page":"6399","DOI":"10.1103\/PhysRevA.44.6399","volume":"44","author":"E.D. Weinberger","year":"1991","unstructured":"Weinberger, E.D.: Local properties of kauffman\u2019s N-k model: A tunably rugged enegy landscape. Physical Review A\u00a044(10), 6399\u20136413 (1991)","journal-title":"Physical Review A"},{"key":"80_CR10","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature, 178\u2013187 (1996)","DOI":"10.1007\/3-540-61723-X_982"},{"key":"80_CR11","unstructured":"Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 511\u2013518 (2001); Also IlliGAL Report No. 2000020"},{"key":"80_CR12","unstructured":"Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA (1994)"},{"issue":"1","key":"80_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M. Pelikan","year":"2002","unstructured":"Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications\u00a021(1), 5\u201320 (2002); Also IlliGAL Report No. 99018","journal-title":"Computational Optimization and Applications"},{"volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","year":"2002","key":"80_CR14","unstructured":"Larra\u00f1aga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston (2002)"},{"key":"80_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/b10910","volume-title":"Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms","author":"M. Pelikan","year":"2005","unstructured":"Pelikan, M.: Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, Heidelberg (2005)"},{"key":"80_CR16","doi-asserted-by":"crossref","unstructured":"Thierens, D., Goldberg, D.E., Pereira, A.G.: Domino convergence, drift, and the temporal-salience structure of problems. In: Proceedings of the International Conference on Evolutionary Computation (ICEC 1998), pp. 535\u2013540 (1998)","DOI":"10.1109\/ICEC.1998.700085"},{"key":"80_CR17","first-page":"15","volume-title":"Parallel Problem Solving from Nature","author":"H. M\u00fchlenbein","year":"1992","unstructured":"M\u00fchlenbein, H.: How genetic algorithms really work: I. Mutation and Hillclimbing. In: M\u00e4nner, R., Manderick, B. (eds.) Parallel Problem Solving from Nature, pp. 15\u201325. Elsevier Science, Amsterdam, Netherlands (1992)"},{"key":"80_CR18","unstructured":"Thierens, D.: Analysis and design of genetic algorithms. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium (1995)"},{"key":"80_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3643-4","volume-title":"The design of innovation: Lessons from and for competent genetic algorithms. Genetic Algorithms and Evolutionary Computation","author":"D.E. Goldberg","year":"2002","unstructured":"Goldberg, D.E.: The design of innovation: Lessons from and for competent genetic algorithms. Genetic Algorithms and Evolutionary Computation, vol.\u00a07. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"80_CR20","volume-title":"Adaptation in natural and artificial systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"80_CR21","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading (1989)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T07:11:56Z","timestamp":1736579516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11844297_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}