{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T00:06:53Z","timestamp":1774397213300,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"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_41","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"586-599","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Theoretical Study of\u00a0Optimizing Rugged Landscapes with\u00a0the\u00a0cGA"],"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":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aishwarya","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"41_CR1","unstructured":"Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley (1997)"},{"key":"41_CR2","doi-asserted-by":"publisher","unstructured":"Aishwaryaprajna, Rowe, J.E.: Noisy combinatorial optimisation by evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, pp. 139\u2013140 (2019). https:\/\/doi.org\/10.1145\/3319619.3321955","DOI":"10.1145\/3319619.3321955"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1162\/evco_a_00193","volume":"25","author":"F Daolio","year":"2017","unstructured":"Daolio, F., Liefooghe, A., Verel, S., Aguirre, H., Tanaka, K.: Problem features versus algorithm performance on rugged multiobjective combinatorial fitness landscapes. Evol. Comput. 25, 555\u2013585 (2017)","journal-title":"Evol. Comput."},{"key":"41_CR4","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-29414-4_1","volume-title":"Theory of Evolutionary Computation","author":"B Doerr","year":"2020","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: Theory of Evolutionary Computation. NCS, pp. 1\u201387. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_1"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1007\/s00453-020-00780-w","volume":"83","author":"B Doerr","year":"2021","unstructured":"Doerr, B.: The runtime of the compact genetic algorithm on jump functions. Algorithmica 83, 3059\u20133107 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00780-w","journal-title":"Algorithmica"},{"key":"41_CR6","doi-asserted-by":"publisher","unstructured":"Doerr, B., Zheng, W.: From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm. In: Coello, C.A.C. (ed.) Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 805\u2013813 (2020). https:\/\/doi.org\/10.1145\/3377930.3390163","DOI":"10.1145\/3377930.3390163"},{"issue":"6","key":"41_CR7","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1109\/TEVC.2020.2987361","volume":"24","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Zheng, W.: Sharp bounds for genetic drift in estimation of distribution algorithms. IEEE Trans. Evol. Comput. 24(6), 1140\u20131149 (2020). https:\/\/doi.org\/10.1109\/TEVC.2020.2987361","journal-title":"IEEE Trans. Evol. Comput."},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"41_CR9","doi-asserted-by":"publisher","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing, 2nd edn. Natural Computing Series. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-44874-8","DOI":"10.1007\/978-3-662-44874-8"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/978-3-319-45823-6_71","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"T Friedrich","year":"2016","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: Graceful scaling on uniform versus steep-tailed noise. 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. 761\u2013770. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_71"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M., Sutton, A.M.: The benefit of sex in noisy evolutionary search (2015)","DOI":"10.1145\/2908961.2930953"},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2016.2613739","volume":"21","author":"T Friedrich","year":"2017","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: The compact genetic algorithm is efficient under extreme gaussian noise. Trans. Evol. Comput. 21, 477\u2013490 (2017). https:\/\/doi.org\/10.1109\/TEVC.2016.2613739","journal-title":"Trans. Evol. Comput."},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s00453-015-0072-0","volume":"75","author":"C Gie\u00dfen","year":"2016","unstructured":"Gie\u00dfen, C., K\u00f6tzing, T.: Robustness of populations in stochastic environments. Algorithmica 75, 462\u2013489 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0072-0","journal-title":"Algorithmica"},{"key":"41_CR14","doi-asserted-by":"publisher","unstructured":"Horoba, C., Sudholt, D.: Ant colony optimization for stochastic shortest path problems. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, GECCO 2010, pp. 1465\u20131472 (2010). https:\/\/doi.org\/10.1145\/1830483.1830750","DOI":"10.1145\/1830483.1830750"},{"key":"41_CR15","doi-asserted-by":"publisher","unstructured":"Krejca, M.S.: Theoretical analyses of univariate estimation-of-distribution algorithms. Doctoral thesis, Universit\u00e4t Potsdam (2019). https:\/\/doi.org\/10.25932\/publishup-43487","DOI":"10.25932\/publishup-43487"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1007\/s00453-020-00778-4","volume":"83","author":"J Lengler","year":"2021","unstructured":"Lengler, J., Sudholt, D., Witt, C.: The complex parameter landscape of the compact genetic algorithm. Algorithmica 83, 1096\u20131137 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00778-4","journal-title":"Algorithmica"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Malan, K.M., Engelbrecht, A.P.: Quantifying ruggedness of continuous landscapes using entropy. In: IEEE Congress on Evolutionary Computation, pp. 1440\u20131447 (2009)","DOI":"10.1109\/CEC.2009.4983112"},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"Myburgh, C., Deb, K.: Evolutionary algorithms in large-scale open pit mine scheduling. In: GECCO, pp. 1155\u20131162. ACM (2010)","DOI":"10.1145\/1830483.1830696"},{"key":"41_CR19","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ins.2020.03.112","volume":"534","author":"M Neshat","year":"2020","unstructured":"Neshat, M., Alexander, B., Wagner, M.: A hybrid cooperative co-evolution algorithm framework for optimising power take off and placements of wave energy converters. Inf. Sci. 534, 218\u2013244 (2020)","journal-title":"Inf. Sci."},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Osada, Y., While, R.L., Barone, L., Michalewicz, Z.: Multi-mine planning using a multi-objective evolutionary algorithm. In: IEEE Congress on Evolutionary Computation, pp. 2902\u20132909 (2013)","DOI":"10.1109\/CEC.2013.6557922"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Pelikan, M., Hauschild, M., Lobo, F.G.: Estimation of distribution algorithms. In: Kacprzyk, J., Pedrycz, W. (eds.) Handbook of Computational Intelligence, pp. 899\u2013928 (2015)","DOI":"10.1007\/978-3-662-43505-2_45"},{"key":"41_CR22","series-title":"Infosys Science Foundation Series","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-81-322-2184-5_2","volume-title":"Evolutionary Constrained Optimization","author":"S Poursoltan","year":"2015","unstructured":"Poursoltan, S., Neumann, F.: Ruggedness quantifying for constrained continuous fitness landscapes. In: Datta, R., Deb, K. (eds.) Evolutionary Constrained Optimization. ISFS, pp. 29\u201350. Springer, New Delhi (2015). https:\/\/doi.org\/10.1007\/978-81-322-2184-5_2"},{"key":"41_CR23","doi-asserted-by":"publisher","unstructured":"Prugel-Bennett, A., Rowe, J., Shapiro, J.: Run-time analysis of population-based evolutionary algorithm in noisy environments. In: Proceedings of the 2015 8th Conference on Foundations of Genetic Algorithms, FOGA 2015, pp. 69\u201375 (2015). https:\/\/doi.org\/10.1145\/2725494.2725498","DOI":"10.1145\/2725494.2725498"},{"key":"41_CR24","doi-asserted-by":"crossref","unstructured":"Tran, R., Wu, J., Denison, C., Ackling, T., Wagner, M., Neumann, F.: Fast and effective multi-objective optimisation of wind turbine placement. In: GECCO, pp. 1381\u20131388. ACM (2013)","DOI":"10.1145\/2463372.2463541"}],"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_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:02:54Z","timestamp":1710259374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_41","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)"}}]}}