{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T18:13:47Z","timestamp":1770747227650,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_31","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"442-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Escaping Local Optima with\u00a0Local Search: A Theory-Driven Discussion"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Friedrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin S.","family":"Krejca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amirhossein","family":"Rajabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9780691187563","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"2003","unstructured":"Aarts, E., Aarts, E.H., Lenstra, J.K.: Local Search in Combinatorial Optimization. Princeton University Press, Princeton (2003)"},{"key":"31_CR2","doi-asserted-by":"publisher","unstructured":"Antipov, D., Doerr, B.: Precise runtime analysis for plateau functions. ACM Trans. Evol. Learn. Optim. 1(4), 13:1\u201313:28 (2021). https:\/\/doi.org\/10.1145\/3469800","DOI":"10.1145\/3469800"},{"key":"31_CR3","doi-asserted-by":"publisher","unstructured":"Bambury, H., Bultel, A., Doerr, B.: Generalized jump functions. In: Proceedings of GECCO 2021, pp. 1124\u20131132. ACM (2021). https:\/\/doi.org\/10.1145\/3449639.3459367","DOI":"10.1145\/3449639.3459367"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2020.07.001","volume":"843","author":"C Bian","year":"2020","unstructured":"Bian, C., Qian, C., Tang, K., Yu, Y.: Running time analysis of the (1+1)-EA for robust linear optimization. Theor. Comput. Sci. 843, 57\u201372 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.07.001","journal-title":"Theor. Comput. Sci."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of GECCO 2017, pp. 777\u2013784. ACM Press (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"31_CR6","doi-asserted-by":"publisher","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Bosman, P.A.N. (ed.) Proceedings of GECCO 2017, pp. 777\u2013784. ACM (2017). https:\/\/doi.org\/10.1145\/3071178.3071301","DOI":"10.1145\/3071178.3071301"},{"key":"31_CR7","doi-asserted-by":"publisher","unstructured":"Doerr, B., Rajabi, A.: Stagnation detection meets fast mutation. In: Proceedings of EvoCOP 2022, pp. 191\u2013207. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-04148-8_13","DOI":"10.1007\/978-3-031-04148-8_13"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","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":"31_CR10","doi-asserted-by":"publisher","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 759\u2013787. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_19","DOI":"10.1007\/978-3-319-07124-4_19"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Horn, J., Goldberg, D.E.: Genetic algorithm difficulty and the modality of fitness landscapes. In: Proceedings of FOGA 1995, vol. 3, pp. 243\u2013269. Elsevier (1995)","DOI":"10.1016\/B978-1-55860-356-1.50016-9"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Jagerskupper, J., Storch, T.: When the plus strategy outperforms the comma strategy and when not. In: 2007 IEEE Symposium on Foundations of Computational Intelligence, pp. 25\u201332. IEEE (2007)","DOI":"10.1109\/FOCI.2007.372143"},{"key":"31_CR13","doi-asserted-by":"publisher","unstructured":"Jansen, T., Wegener, I.: A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation. Theor. Comput. Sci. 386(1), 73\u201393 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.06.003, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397507004811","DOI":"10.1016\/j.tcs.2007.06.003"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/978-3-319-45823-6_74","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"T Jansen","year":"2016","unstructured":"Jansen, T., Zarges, C.: Example landscapes to support analysis of multimodal optimisation. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 792\u2013802. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_74"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/BFb0032050","volume-title":"Automata, Languages and Programming","author":"DS Johnson","year":"1990","unstructured":"Johnson, D.S.: Local optimization and the Traveling Salesman Problem. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 446\u2013461. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032050"},{"key":"31_CR16","doi-asserted-by":"publisher","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-16544-3","DOI":"10.1007\/978-3-642-16544-3"},{"key":"31_CR17","doi-asserted-by":"publisher","unstructured":"Nguyen, P.T.H., Sudholt, D.: Memetic algorithms outperform evolutionary algorithms in multimodal optimisation. Artif. Intell. 287, 103345 (2020). https:\/\/doi.org\/10.1016\/j.artint.2020.103345","DOI":"10.1016\/j.artint.2020.103345"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-45356-3_38","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"M Pelikan","year":"2000","unstructured":"Pelikan, M., Goldberg, D.E.: Genetic algorithms, clustering, and the breaking of symmetry. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 385\u2013394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_38"},{"issue":"1","key":"31_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2004.03.038","volume":"320","author":"A Pr\u00fcgel-Bennett","year":"2004","unstructured":"Pr\u00fcgel-Bennett, A.: When a genetic algorithm outperforms hill-climbing. Theoret. Comput. Sci. 320(1), 135\u2013153 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0056851","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"RJ Quick","year":"1998","unstructured":"Quick, R.J., Rayward-Smith, V.J., Smith, G.D.: Fitness distance correlation and Ridge functions. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 77\u201386. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056851"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Stagnation detection in highly multimodal fitness landscapes. In: Proceedings of GECCO 2021. ACM Press (2021)","DOI":"10.1145\/3449639.3459336"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-72904-2_10","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"A Rajabi","year":"2021","unstructured":"Rajabi, A., Witt, C.: Stagnation detection with randomized local search. In: Zarges, C., Verel, S. (eds.) EvoCOP 2021. LNCS, vol. 12692, pp. 152\u2013168. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72904-2_10"},{"key":"31_CR23","doi-asserted-by":"publisher","unstructured":"Rajabi, A., Witt, C.: Self-adjusting evolutionary algorithms for multimodal optimization. Algorithmica 84, 1694\u20131723 (2022). https:\/\/doi.org\/10.1007\/s00453-022-00933-z. Preliminary version in GECCO 2020","DOI":"10.1007\/s00453-022-00933-z"},{"key":"31_CR24","volume-title":"Evolutionary Optimization Algorithms","author":"D Simon","year":"2013","unstructured":"Simon, D.: Evolutionary Optimization Algorithms. Wiley, Hoboken (2013)"},{"key":"31_CR25","unstructured":"St\u00fctzle, T.: Applying iterated local search to the permutation flow shop problem. Technical report, Citeseer (1998)"},{"issue":"01","key":"31_CR26","first-page":"10","volume":"11","author":"C Van Hoyweghen","year":"2001","unstructured":"Van Hoyweghen, C., Goldberg, D.E., Naudts, B.: From TwoMax to the Ising model: easy and hard symmetrical problems. Generations 11(01), 10 (2001)","journal-title":"Generations"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:02:06Z","timestamp":1710259326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}