{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:02:56Z","timestamp":1786978976011,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319458229","type":"print"},{"value":"9783319458236","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_74","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T09:26:31Z","timestamp":1472549191000},"page":"792-802","source":"Crossref","is-referenced-by-count":15,"title":["Example Landscapes to Support Analysis of Multimodal Optimisation"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Jansen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christine","family":"Zarges","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"74_CR1","doi-asserted-by":"crossref","unstructured":"Branke, J.: Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of CEC, pp. 1875\u20131882. IEEE Press (1999)","DOI":"10.1109\/CEC.1999.785502"},{"issue":"5","key":"74_CR2","first-page":"57","volume":"5","author":"B Doerr","year":"2016","unstructured":"Doerr, B., Hansen, N., Igel, C., Thiele, L.: Theory of evolutionary algorithms (Dagstuhl seminar 15211). Dagstuhl Rep. 5(5), 57\u201391 (2016)","journal-title":"Dagstuhl Rep."},{"issue":"3","key":"74_CR3","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/s00453-012-9684-9","volume":"68","author":"B Doerr","year":"2014","unstructured":"Doerr, B., Winzen, C.: Ranking-based black-box complexity. Algorithmica 68(3), 571\u2013609 (2014)","journal-title":"Algorithmica"},{"key":"74_CR4","doi-asserted-by":"crossref","unstructured":"Droste, S., Jansen, T., Wegener, I.: A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for linear functions with Boolean inputs. In: Proceedings of ICEC, pp. 499\u2013504. IEEE Press (1998)","DOI":"10.1109\/ICEC.1998.700079"},{"issue":"2\u20133","key":"74_CR5","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.tcs.2005.04.002","volume":"344","author":"S Fischer","year":"2005","unstructured":"Fischer, S., Wegener, I.: The one-dimensional Ising model: mutation versus recombination. Theor. Comput. Sci. 344(2\u20133), 208\u2013225 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"74_CR6","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1162\/evco.2009.17.4.17401","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich, T., Oliveto, P.S., Sudholt, D., Witt, C.: Analysis of diversity-preserving mechanisms for global exploration. Evol. Comput. 17(4), 455\u2013476 (2009)","journal-title":"Evol. Comput."},{"key":"74_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127, 57\u201385 (2001)","journal-title":"Artif. Intell."},{"key":"74_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17339-4","volume-title":"Analyzing Evolutionary Algorithms. The Computer Science Perspective","author":"T Jansen","year":"2013","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms. The Computer Science Perspective. Springer, Heidelberg (2013)"},{"key":"74_CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.tcs.2013.06.007","volume":"545","author":"T Jansen","year":"2014","unstructured":"Jansen, T., Zarges, C.: Performance analysis of randomised search heuristics operating with a fixed budget. Theor. Comput. Sci. 545, 39\u201358 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"74_CR10","first-page":"38","volume-title":"Proceedings of PPSN","author":"KD Jong","year":"1990","unstructured":"Jong, K.D., Spears, W.M.: An analysis of the interacting roles of population size and crossover in genetic algorithms. In: Schwefel, H.-P., Manner, R. (eds.) Proceedings of PPSN, pp. 38\u201347. Springer, Heidelberg (1990)"},{"key":"74_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Spears, W.M.: Matching algorithms to problems: an experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator. In: Proceedings of WCCI, pp. 78\u201383. IEEE Press (1998)","DOI":"10.1109\/ICEC.1998.699326"},{"key":"74_CR12","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Lissovoi, A., Witt, C.: (1+1) EA on generalized dynamic onemax. In: Proceedings of FOGA, pp. 40\u201351. ACM Press (2015)","DOI":"10.1145\/2725494.2725502"},{"key":"74_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/978-3-642-12139-5_17","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"A Moraglio","year":"2010","unstructured":"Moraglio, A., Johnson, C.G.: Geometric generalization of the Nelder-Mead algorithm. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 190\u2013201. Springer, Heidelberg (2010)"},{"key":"74_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"74_CR15","unstructured":"M\u00fchlenbein, H.: How genetic algorithms really work: mutation and hillclimbing. In: Proceedings of PPSN, pp. 15\u201326. Elsevier (1992)"},{"key":"74_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1007\/978-3-319-10762-2_92","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"PS Oliveto","year":"2014","unstructured":"Oliveto, P.S., Sudholt, D., Zarges, C.: On the runtime analysis of\u00a0fitness\u00a0sharing\u00a0mechanisms. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 932\u2013941. Springer, Heidelberg (2014)"},{"key":"74_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-07407-8","volume-title":"Multimodal Optimization by Means of Evolutionary Algorithms","author":"M Preuss","year":"2015","unstructured":"Preuss, M.: Multimodal Optimization by Means of Evolutionary Algorithms. Springer, Heidelberg (2015)"},{"issue":"3","key":"74_CR18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/TEVC.2011.2163638","volume":"16","author":"A Pr\u00fcgel-Bennett","year":"2012","unstructured":"Pr\u00fcgel-Bennett, A., Tayarani-Najaran, M.: Maximum satisfiability: anatomy of the fitness landscape for a hard combinatorial optimization problem. IEEE Trans. Evol. Comput. 16(3), 319\u2013338 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"74_CR19","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1007\/978-3-540-92910-9_32","volume-title":"Handbook of Natural Computing","author":"OM Shir","year":"2012","unstructured":"Shir, O.M.: Niching in evolutionary algorithms. In: Rozenberg, G., B\u00e4ck, T., Kok, J.N. (eds.) Handbook of Natural Computing, pp. 1035\u20131070. Springer, Heidelberg (2012)"},{"key":"74_CR20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-45692-9_10","volume":"585","author":"P Stadler","year":"2002","unstructured":"Stadler, P.: Fitness landscapes. Biol. Evol. Stat. Phys. 585, 183\u2013204 (2002)","journal-title":"Biol. Evol. Stat. Phys."},{"key":"74_CR21","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: Proceedings of GECCO, pp. 1161\u20131167. ACM Press (2005)","DOI":"10.1145\/1068009.1068202"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:38:54Z","timestamp":1498325934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}