{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:20:43Z","timestamp":1742952043357,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223436"},{"type":"electronic","value":"9783540248552"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24855-2_26","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T08:20:59Z","timestamp":1284452459000},"page":"294-306","source":"Crossref","is-referenced-by-count":12,"title":["Ruffled by Ridges: How Evolutionary Algorithms Can Fail"],"prefix":"10.1007","author":[{"given":"Darrell","family":"Whitley","sequence":"first","affiliation":[]},{"given":"Monte","family":"Lunacek","sequence":"additional","affiliation":[]},{"given":"James","family":"Knight","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/comjnl\/3.3.175","volume":"3","author":"H. Rosenbrock","year":"1960","unstructured":"Rosenbrock, H.: An automatic method for finding the greatest or least value of a function. Computer Journal\u00a03, 175\u2013184 (1960)","journal-title":"Computer Journal"},{"key":"26_CR2","unstructured":"Brent, R.: Algorithms for Minization with Derivatives. Dover (1973)"},{"key":"26_CR3","volume-title":"Foundations of Genetic Algorithms FOGA-6","author":"D. Whitley","year":"2001","unstructured":"Whitley, D., Barbulescu, L., Watson, J.: Local Search and High Precision Gray Codes. In: Foundations of Genetic Algorithms FOGA-6, Morgan Kaufmann, San Francisco (2001)"},{"key":"26_CR4","unstructured":"Rana, S., Whitley, D.: Representations, Search and Local Optima. In: 14th National Conf on Artificial Intelligence AAAI 1997, pp. 497\u2013502(1997)"},{"key":"26_CR5","first-page":"239","volume-title":"FOGA - 2","author":"G. Syswerda","year":"1993","unstructured":"Syswerda, G.: Simulated Crossover in Genetic Algorithms. In: Whitley, D. (ed.) FOGA - 2, pp. 239\u2013255. Morgan Kaufmann, San Francisco (1993)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1162\/evco.1998.6.2.129","volume":"6","author":"S.T. Kazadi","year":"1998","unstructured":"Kazadi, S.T.: Conjugate schema and basis representation of crossover and mutation operators. Evolutionary Computation\u00a06, 129\u2013160 (1998)","journal-title":"Evolutionary Computation"},{"key":"26_CR7","first-page":"1518","volume-title":"GECCO","author":"D. Wyatt","year":"2003","unstructured":"Wyatt, D., Lipson, H.: Finding building blocks through eigenstructure adaptation. In: GECCO, pp. 1518\u20131529. Morgan Kaufmann, San Francisco (2003)"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0303-2647(96)01621-8","volume":"39","author":"R. Salomon","year":"1960","unstructured":"Salomon, R.: Reevaluating Genetic Algorithm Performance under Coordinate Rotation of Benchmark Functions. Biosystems\u00a039(3), 263\u2013278 (1960)","journal-title":"Biosystems"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1162\/evco.1993.1.1.25","volume":"1","author":"H. M\u00fchlenbein","year":"1993","unstructured":"M\u00fchlenbein, H., Schlierkamp-Voosen, D.: Predictive Models for the Breeder Genetic Algorithm. Journal of Evolutionary Computation\u00a01, 25\u201349 (1993)","journal-title":"Journal of Evolutionary Computation"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/BFb0056847","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"A. Oyman","year":"1998","unstructured":"Oyman, A., Schwefel, H.B.H.: Where elitists start limping: Evolution strategies at ridge functions. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 34\u201343. Springer, Heidelberg (1998)"},{"key":"26_CR11","unstructured":"DeJong, K.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Dept. of Computer and Communication Sciences (1975)"},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J. Nelder","year":"1965","unstructured":"Nelder, J., Mead, R.: A simplex method for function minimization. Computer Journal\u00a07, 308\u2013313 (1965)","journal-title":"Computer Journal"},{"key":"26_CR13","first-page":"18","volume-title":"Proc. of the 4th Int\u2019l. Conf. on GAs","author":"L. Davis","year":"1991","unstructured":"Davis, L.: Bit-Climbing, Representational Bias, and Test Suite Design. In: Booker, L., Belew, R. (eds.) Proc. of the 4th Int\u2019l. Conf. on GAs, pp. 18\u201323. Morgan Kaufmann, San Francisco (1991)"},{"key":"26_CR14","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice","author":"T. B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, Oxford (1996)"},{"key":"26_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N. Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation\u00a09, 159\u2013195 (2001)","journal-title":"Evolutionary Computation"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1162\/evco.1994.2.4.369","volume":"2","author":"A. Ostermeier","year":"1994","unstructured":"Ostermeier, A., Gawelczyk, A., Hansen, N.: A derandomized approach to selfadaptation of evolution strategies. Evolutionary Computation\u00a02, 369\u2013380 (1994)","journal-title":"Evolutionary Computation"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N. Hansen","year":"2003","unstructured":"Hansen, N., M\u00e3ller, S., Koumoutsakos, P.: Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation. Evolutionary Computation\u00a011, 1\u201318 (2003)","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2013 GECCO 2004"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24855-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T23:14:01Z","timestamp":1676070841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24855-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223436","9783540248552"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24855-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}