{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:47:53Z","timestamp":1760647673247,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147203"},{"type":"electronic","value":"9783031147210"}],"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_28","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"399-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A First Runtime Analysis of\u00a0the\u00a0NSGA-II on\u00a0a\u00a0Multimodal Problem"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongdi","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1268\u20131276. ACM (2020)","DOI":"10.1145\/3377930.3390172"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-030-58115-2_39","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"D Antipov","year":"2020","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: First steps towards a runtime analysis when starting with a good solution. In: B\u00e4ck, T., et al. (eds.) PPSN 2020, Part II. LNCS, vol. 12270, pp. 560\u2013573. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58115-2_39"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1115\u20131123. ACM (2021)","DOI":"10.1145\/3449639.3459377"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1007\/s00453-022-00957-5","volume":"84","author":"D Antipov","year":"2022","unstructured":"Antipov, D., Buzdalov, M., Doerr, B.: Fast mutation in crossover-based algorithms. Algorithmica 84, 1724\u20131761 (2022)","journal-title":"Algorithmica"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-030-58115-2_38","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"D Antipov","year":"2020","unstructured":"Antipov, D., Doerr, B.: Runtime analysis of a heavy-tailed $$(1+(\\lambda ,\\lambda ))$$ genetic algorithm on jump functions. In: B\u00e4ck, T., et al. (eds.) PPSN 2020, Part II. LNCS, vol. 12270, pp. 545\u2013559. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58115-2_38"},{"volume-title":"Theory of Randomized Search Heuristics","year":"2011","key":"28_CR6","unstructured":"Auger, A., Doerr, B. (eds.): Theory of Randomized Search Heuristics. World Scientific Publishing, Hackensack (2011)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Bian, C., Qian, C.: Running time analysis of the non-dominated sorting genetic algorithm II (NSGA-II) using binary or stochastic tournament selection. In: Rudolph, G., et al. (eds.) PPSN 2022. LNCS, vol. 13399, pp. xx-yy. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-14721-0_30"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Brockhoff, D.: Theoretical aspects of evolutionary multiobjective optimization. In: Auger, A., Doerr, B. (eds.) Theory of Randomized Search Heuristics, pp. 101\u2013140. World Scientific Publishing (2011)","DOI":"10.1142\/9789814282673_0004"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Corus, D., Oliveto, P.S., Yazdani, D.: Automatic adaptation of hypermutation rates for multimodal optimisation. In: Foundations of Genetic Algorithms, FOGA 2021, pp. 4:1\u20134:12. ACM (2021)","DOI":"10.1145\/3450218.3477305"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Dang, D., et al.: Escaping local optima with diversity mechanisms and crossover. In: Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 645\u2013652. ACM (2016)","DOI":"10.1145\/2908812.2908956"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"D Dang","year":"2018","unstructured":"Dang, D., et al.: Escaping local optima using crossover with emergent diversity. IEEE Trans. Evol. Comput. 22, 484\u2013497 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 777\u2013784. ACM (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation-Recent Developments in Discrete Optimization. Springer, Cham (2020). cs.adelaide.edu.au\/~frank\/papers\/TheoryBook2019-selfarchived.pdf","DOI":"10.1007\/978-3-030-29414-4"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Doerr, B., Qu, Z.: A first runtime analysis of the NSGA-II on a multimodal problem. CoRR abs\/2204.07637 (2022)","DOI":"10.1145\/3583133.3595839"},{"key":"28_CR16","doi-asserted-by":"publisher","unstructured":"Doerr, B., Rajabi, A.: Stagnation detection meets fast mutation. In: P\u00e9rez C\u00e1ceres, L., Verel, S. (eds.) Evolutionary Computation in Combinatorial Optimization, EvoCOP 2022. LNCS, vol. 13222, 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":"28_CR17","doi-asserted-by":"crossref","unstructured":"Doerr, B., Zheng, W.: Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives. In: Conference on Artificial Intelligence, AAAI 2021, pp. 12293\u201312301. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i14.17459"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-99253-2_11","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"T Friedrich","year":"2018","unstructured":"Friedrich, T., G\u00f6bel, A., Quinzan, F., Wagner, M.: Heavy-tailed mutation operators in single-objective combinatorial optimization. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018, Part I. LNCS, vol. 11101, pp. 134\u2013145. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_11"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Quinzan, F., Wagner, M.: Escaping large deceptive basins of attraction with heavy-tailed mutation operators. In: Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 293\u2013300. ACM (2018)","DOI":"10.1145\/3205455.3205515"},{"key":"28_CR20","doi-asserted-by":"publisher","unstructured":"Jansen, T.: Analyzing Evolutionary Algorithms - The Computer Science Perspective. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-17339-4","DOI":"10.1007\/978-3-642-17339-4"},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: The analysis of evolutionary algorithms - a proof that crossover really can help. Algorithmica 34, 47\u201366 (2002)","journal-title":"Algorithmica"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-642-15844-5_67","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Theile, M.: How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010, Part I. LNCS, vol. 6238, pp. 667\u2013676. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_67"},{"key":"28_CR23","doi-asserted-by":"publisher","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16544-3","DOI":"10.1007\/978-3-642-16544-3"},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.artint.2013.09.002","volume":"204","author":"C Qian","year":"2013","unstructured":"Qian, C., Yu, Y., Zhou, Z.: An analysis on recombination in multi-objective evolutionary optimization. Artif. Intell. 204, 99\u2013119 (2013)","journal-title":"Artif. Intell."},{"issue":"3","key":"28_CR25","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s11047-021-09841-7","volume":"20","author":"F Quinzan","year":"2021","unstructured":"Quinzan, F., G\u00f6bel, A., Wagner, M., Friedrich, T.: Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations. Nat. Comput. 20(3), 561\u2013575 (2021). https:\/\/doi.org\/10.1007\/s11047-021-09841-7","journal-title":"Nat. Comput."},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Self-adjusting evolutionary algorithms for multimodal optimization. In: Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1314\u20131322. ACM (2020)","DOI":"10.1145\/3377930.3389833"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Stagnation detection in highly multimodal fitness landscapes. In: Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 1178\u20131186. ACM (2021)","DOI":"10.1145\/3449639.3459336"},{"key":"28_CR28","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":"28_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-95957-3_4","volume-title":"Intelligent Computing Methodologies","author":"M Wu","year":"2018","unstructured":"Wu, M., Qian, C., Tang, K.: Dynamic mutation based pareto optimization for subset selection. In: Huang, D.-S., Gromiha, M.M., Han, K., Hussain, A. (eds.) ICIC 2018, Part III. LNCS (LNAI), vol. 10956, pp. 25\u201335. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-95957-3_4"},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"Zheng, W., Doerr, B.: Better approximation guarantees for the NSGA-II by using the current crowding distance. In: Genetic and Evolutionary Computation Conference, GECCO 2022. ACM (2022). arxiv.org\/abs\/2203.02693","DOI":"10.1145\/3512290.3528847"},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"Zheng, W., Liu, Y., Doerr, B.: A first mathematical runtime analysis of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). In: Conference on Artificial Intelligence, AAAI 2022. AAAI Press (2022). arxiv.org\/abs\/2112.08581","DOI":"10.1145\/3520304.3534070"},{"key":"28_CR32","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou, A., Qu, B.Y., Li, H., Zhao, S.Z., Suganthan, P.N., Zhang, Q.: Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol. Comput. 1, 32\u201349 (2011)","journal-title":"Swarm Evol. Comput."}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:01:47Z","timestamp":1710259307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}