{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:50:33Z","timestamp":1742961033234,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581114"},{"type":"electronic","value":"9783030581121"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58112-1_46","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"664-677","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Evolutionary Algorithms with Self-adjusting Asymmetric Mutation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0898-5003","authenticated-orcid":false,"given":"Amirhossein","family":"Rajabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6105-7700","authenticated-orcid":false,"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Probabilistic tools for the analysis of randomized optimization heuristics. In: Doerr and Neumann [6], pp. 1\u201387","DOI":"10.1007\/978-3-030-29414-4_1"},{"issue":"5","key":"46_CR2","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1007\/s00453-017-0354-9","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C.: Optimal static and self-adjusting parameter choices for the (1+($$\\lambda $$, $$\\lambda $$)) genetic algorithm. Algorithmica 80(5), 1658\u20131709 (2018)","journal-title":"Algorithmica"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. In: Doerr and Neumann [6], pp. 271\u2013321","DOI":"10.1007\/978-3-030-29414-4_6"},{"issue":"5","key":"46_CR4","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1007\/s00453-017-0341-1","volume":"80","author":"B Doerr","year":"2018","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: Static and self-adjusting mutation strengths for multi-valued decision variables. Algorithmica 80(5), 1732\u20131768 (2018)","journal-title":"Algorithmica"},{"issue":"2","key":"46_CR5","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00453-018-0502-x","volume":"81","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Gie\u00dfen, C., Witt, C., Yang, J.: The (1 + $$\\lambda $$) evolutionary algorithm with self-adjusting mutation rate. Algorithmica 81(2), 593\u2013631 (2019)","journal-title":"Algorithmica"},{"key":"46_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4","volume-title":"Theory of Evolutionary Computation - Recent Developments in Discrete Optimization","year":"2020","unstructured":"Doerr, B., Neumann, F. (eds.): Theory of Evolutionary Computation - Recent Developments in Discrete Optimization. Springer, Heidelberg (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29414-4"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. In: Proceedings of GECCO 2018, pp. 1475\u20131482. ACM Press (2018)","DOI":"10.1145\/3205455.3205569"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Doerr, C.: Complexity theory for discrete black-box optimization heuristics. In: Doerr and Neumann [6], pp. 133\u2013212","DOI":"10.1007\/978-3-030-29414-4_3"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Doerr, C., Wagner, M.: Sensitivity of parameter control mechanisms with respect to their initialization. In: Proceedings of PPSN 2018, pp. 360\u2013372 (2018)","DOI":"10.1007\/978-3-319-99259-4_29"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Doerr, C., Ye, F., van Rijn, S., Wang, H., B\u00e4ck, T.: Towards a theory-guided benchmarking suite for discrete black-box optimization heuristics: profiling (1+$$\\lambda $$) EA variants on OneMax and LeadingOnes. In: Proceedings of GECCO 2018, pp. 951\u2013958. ACM Press (2018)","DOI":"10.1145\/3205455.3205621"},{"key":"46_CR11","unstructured":"Fajardo, M.A.H.: An empirical evaluation of success-based parameter control mechanisms for evolutionary algorithms. In: Proceedings of GECCO 2019, pp. 787\u2013795. ACM Press (2019)"},{"key":"46_CR12","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 1, 3rd edn. Wiley, Hoboken (1968)","edition":"3"},{"key":"46_CR13","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17339-4"},{"issue":"1","key":"46_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.2010.18.1.18101","volume":"18","author":"T Jansen","year":"2010","unstructured":"Jansen, T., Sudholt, D.: Analysis of an asymmetric mutation operator. Evol. Comput. 18(1), 1\u201326 (2010)","journal-title":"Evol. Comput."},{"key":"46_CR15","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: 2011 Proceedings of FOGA 2011, Schwarzenberg, Austria, 5\u20138 January 2011, Proceedings, pp. 181\u2013192. ACM Press (2011)"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica64(4), 623\u2013642 (2012)","DOI":"10.1007\/s00453-012-9616-8"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Lengler, J.: Drift analysis. In: Doerr and Neumann [6], pp. 89\u2013131","DOI":"10.1007\/978-3-030-29414-4_2"},{"key":"46_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-319-55750-2_16","volume-title":"Computational Intelligence in Music, Sound, Art and Design","author":"A Neumann","year":"2017","unstructured":"Neumann, A., Alexander, B., Neumann, F.: Evolutionary image transition using random walks. In: Correia, J., Ciesielski, V., Liapis, A. (eds.) EvoMUSART 2017. LNCS, vol. 10198, pp. 230\u2013245. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-55750-2_16"},{"issue":"1","key":"46_CR19","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F Neumann","year":"2007","unstructured":"Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378(1), 32\u201340 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"46_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16544-3","volume-title":"Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity","author":"F Neumann","year":"2010","unstructured":"Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-16544-3"},{"issue":"2","key":"46_CR21","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TEVC.2006.871251","volume":"10","author":"GR Raidl","year":"2006","unstructured":"Raidl, G.R., Koller, G., Julstrom, B.A.: Biased mutation operators for subgraph-selection problems. IEEE Trans. Evol. Comput. 10(2), 145\u2013156 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"46_CR22","unstructured":"Rajabi, A., Witt, C.: Evolutionary algorithms with self-adjusting asymmetric mutation. CoRR (2020). \nhttp:\/\/arxiv.org\/abs\/2006.09126"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"Rajabi, A., Witt, C.: Self-adjusting evolutionary algorithms for multimodal optimization. In: Proceedings of GECCO 2020 (2020, to appear)","DOI":"10.1145\/3377930.3389833"},{"key":"46_CR24","doi-asserted-by":"crossref","unstructured":"Rodionova, A., Antonov, K., Buzdalova, A., Doerr, C.: Offspring population size matters when comparing evolutionary algorithms with self-adjusting mutation rates. In: Proceedings of GECCO 2019, pp. 855\u2013863. ACM Press (2019)","DOI":"10.1145\/3321707.3321827"},{"issue":"3","key":"46_CR25","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00453-015-0027-5","volume":"75","author":"AM Sutton","year":"2016","unstructured":"Sutton, A.M.: Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems. Algorithmica 75(3), 507\u2013528 (2016)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:22:10Z","timestamp":1599063730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 August 2020","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":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"268","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":"99","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":"37% - 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","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":"2.2","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)"}}]}}