{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:56:03Z","timestamp":1743112563916,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332050"},{"type":"electronic","value":"9783642332067"}],"license":[{"start":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T00:00:00Z","timestamp":1384214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T00:00:00Z","timestamp":1384214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-33206-7_4","type":"book-chapter","created":{"date-parts":[[2013,12,19]],"date-time":"2013-12-19T11:06:44Z","timestamp":1387451204000},"page":"63-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Single-Funnel and Multi-funnel Landscapes and Subthreshold-Seeking Behavior"],"prefix":"10.1007","author":[{"given":"Darrell","family":"Whitley","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Rowe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,12]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A Connectionist Machine for Genetic Hillclimbing","author":"D. Ackley","year":"1987","unstructured":"D. Ackley, A Connectionist Machine for Genetic Hillclimbing (Kluwer Academic, Boston, 1987)"},{"key":"4_CR2","volume-title":"On the big valley and adaptive multi-start for discrete global optimizations","author":"K.D. Boese","year":"1993","unstructured":"K.D. Boese, A.B. Kahng, S. Muddu. On the big valley and adaptive multi-start for discrete global optimizations. Technical report, UCLA CS Department, 1993"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"K.D. Boese, A.B. Kahng, S. Muddu, A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16, 101\u2013113 (1994)","journal-title":"Oper. Res. Lett."},{"key":"4_CR4","unstructured":"S. Christensen, F. Oppacher, What can we learn from no free lunch? in GECCO-01, San Francisco, 2001 (Morgan Kaufmann, 2001), pp. 1219\u20131226"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1162\/evco.1998.6.2.109","volume":"6","author":"J. Culberson","year":"1998","unstructured":"J. Culberson, On the futility of blind search. Evolut. Comput. 6(2), 109\u2013127 (1998)","journal-title":"Evolut. Comput."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"J. Doye, M. Miller, D. Wales, The double-funnel energy landscape of the 38-atom Lennard-Jones cluster. J. Chem. Phys. 110(14), (1999)","DOI":"10.1063\/1.478595"},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1287\/ijoc.1040.0084","volume":"16","author":"J. Doye","year":"2004","unstructured":"J. Doye, R. Leary, M. Locatelli, F. Schoen, Global optimization of Morse clusters by potential energy transforms. INFORMS J. Comput. 16(4), 371\u2013379 (2004)","journal-title":"INFORMS J. Comput."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"N. Hansen, S. Kern, Evaluating the CMA evolution strategy on multimodal test functions, in Proceedings of 8th International Conference on Parallel Problem Solving from Nature, Birmingham (Springer, 2004), pp. 282\u2013291","DOI":"10.1007\/978-3-540-30217-9_29"},{"key":"4_CR9","first-page":"477","volume-title":"The dispersion metric and the CMA evolution strategy, in GECCO\u201906: proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, Seattle","author":"M. Lunacek","year":"2006","unstructured":"M. Lunacek, L.D. Whitley, The dispersion metric and the CMA evolution strategy, in GECCO\u201906: proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, Seattle (ACM, New York, 2006), pp. 477\u2013484"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10898-006-9110-4","volume":"39","author":"R. Marcia","year":"2007","unstructured":"R. Marcia, J. Mitchell, J. Rosen, Multi-funnel optimization using Gaussian underestimation. J. Glob. Optim. 39(1), 39\u201348 (2007)","journal-title":"J. Glob. Optim."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"N. Radcliffe, P. Surry, Fundamental limitations on search algorithms: evolutionary computing in perspective, in Computer Science Today, ed. by J. van Leeuwen. Lecture Notes in Computer Science, vol. 1000 (Springer, Berlin\/Heidelberg, 1995)","DOI":"10.1007\/BFb0015249"},{"key":"4_CR12","unstructured":"C. Schumacher, M. Vose, L. Whitley, The no free lunch and problem description length, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), San Francisco, 2001, pp. 565\u2013570"},{"key":"4_CR13","volume-title":"Evolution and Optimum Seeking","author":"H.-P. Schwefel","year":"1995","unstructured":"H.-P. Schwefel, Evolution and Optimum Seeking (Wiley, New York, 1995)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"A.M. Sutton, L.D. Whitley, M. Lunacek, A.E. Howe, PSO and multi-funnel landscapes: how cooperation might limit exploration, in Genetic and Evolutionary Computation Conference (GECCO 2006), Seattle, 2006","DOI":"10.1145\/1143997.1144008"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(96)90023-5","volume":"85","author":"D. Whitley","year":"1996","unstructured":"D. Whitley, K. Mathias, S. Rana, J. Dzubera, Evaluating evolutionary algorithms. Artif. Intell. J. 85, 1\u201332 (1996)","journal-title":"Artif. Intell. J."},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.04.008","volume":"361","author":"D. Whitley","year":"2006","unstructured":"D. Whitley, J. Rowe, Subthreshold-seeking local search. Theor. Comput. Sci. 361(1), 2\u201317 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR17","volume-title":"Focused no free lunch theorems, in GECCO-08, Atlanta (ACM","author":"D. Whitley","year":"2008","unstructured":"D. Whitley, J. Rowe, Focused no free lunch theorems, in GECCO-08, Atlanta (ACM, 2008)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"D. Whitley, J. Rowe, A no free lunch tutorial: sharpened and focused no free lunch, eds. A. Auger, B. Doerr. Theory of Randomized Search Heuristics (World Scientific, Singapore, 2010)","DOI":"10.1142\/9789814282673_0009"},{"key":"4_CR19","first-page":"294","volume":"2","author":"L.D. Whitley","year":"2004","unstructured":"L.D. Whitley, M. Lunacek, J. Knight, Ruffled by ridges: how evolutionary algorithms can fail, in Genetic and Evolutionary Computation Conference, Seattle, vol. 2, 2004, pp. 294\u2013306","journal-title":"Seattle"},{"key":"4_CR20","unstructured":"D. H. Wolpert, W.G. Macready, No free lunch theorems for search. Technical report, SFI-TR-95-02-010, Santa Fe Institute, July 1995"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"4","author":"D.H. Wolpert","year":"1997","unstructured":"D.H. Wolpert, W.G. Macready, No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 4, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Natural Computing Series","Theory and Principled Methods for the Design of Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33206-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T07:12:49Z","timestamp":1675235569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-33206-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,12]]},"ISBN":["9783642332050","9783642332067"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33206-7_4","relation":{},"ISSN":["1619-7127"],"issn-type":[{"type":"print","value":"1619-7127"}],"subject":[],"published":{"date-parts":[[2013,11,12]]},"assertion":[{"value":"12 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}