<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01668262</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-22T09:05:28+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Optimal Static and Self-Adjusting Parameter Choices for the ( 1 + ( λ , λ ) ) Genetic Algorithm</title>
            <author role="aut">
              <persName>
                <forename type="first">Benjamin</forename>
                <surname>Doerr</surname>
              </persName>
              <email type="md5">6fe34ee45c65e78ce2c5b32228c02332</email>
              <email type="domain">lix.polytechnique.fr</email>
              <idno type="idhal" notation="string">benjamin-doerr</idno>
              <idno type="idhal" notation="numeric">751503</idno>
              <idno type="halauthorid" notation="string">54103-751503</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9786-220X</idno>
              <affiliation ref="#struct-2071"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Carola</forename>
                <surname>Doerr</surname>
              </persName>
              <email type="md5">d1b2e33c2d3f25d09951b4c49fa97770</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">carola-doerr</idno>
              <idno type="idhal" notation="numeric">1290</idno>
              <idno type="halauthorid" notation="string">17976-1290</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4981-3227</idno>
              <idno type="IDREF">https://www.idref.fr/232603383</idno>
              <affiliation ref="#struct-441569"/>
              <affiliation ref="#struct-541718"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Carola</forename>
                <surname>Doerr</surname>
              </persName>
              <email type="md5">d1b2e33c2d3f25d09951b4c49fa97770</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-01-19 14:16:50</date>
              <date type="whenModified">2024-12-12 03:43:21</date>
              <date type="whenReleased">2018-01-31 10:04:27</date>
              <date type="whenProduced">2018</date>
              <date type="whenEndEmbargoed">2018-02-07</date>
              <ref type="file" target="https://hal.science/hal-01668262v1/document">
                <date notBefore="2018-02-07"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01668262v1/file/GA-tight-self-Algorithmica-Revision2.pdf" id="file-1688476-1729184">
                <date notBefore="2018-02-07"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="303028">
                <persName>
                  <forename>Carola</forename>
                  <surname>Doerr</surname>
                </persName>
                <email type="md5">d1b2e33c2d3f25d09951b4c49fa97770</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01668262</idno>
            <idno type="halUri">https://hal.science/hal-01668262</idno>
            <idno type="halBibtex">doerr:hal-01668262</idno>
            <idno type="halRefHtml">&lt;i&gt;Algorithmica&lt;/i&gt;, 2018, 80, pp.1658-1709. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s00453-017-0354-9"&gt;&amp;#x27E8;10.1007/s00453-017-0354-9&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Algorithmica, 2018, 80, pp.1658-1709. &amp;#x27E8;10.1007/s00453-017-0354-9&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1688476-1729184"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="X">École polytechnique</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIX" corresp="X">Laboratoire d'informatique de l'Ecole polytechnique</idno>
            <idno type="stamp" n="X-DEP-INFO">Département d'informatique de l’École polytechnique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="X-SACLAY" corresp="UNIV-PARIS-SACLAY">X-SACLAY</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Optimal Static and Self-Adjusting Parameter Choices for the ( 1 + ( λ , λ ) ) Genetic Algorithm</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Benjamin</forename>
                    <surname>Doerr</surname>
                  </persName>
                  <email type="md5">6fe34ee45c65e78ce2c5b32228c02332</email>
                  <email type="domain">lix.polytechnique.fr</email>
                  <idno type="idhal" notation="string">benjamin-doerr</idno>
                  <idno type="idhal" notation="numeric">751503</idno>
                  <idno type="halauthorid" notation="string">54103-751503</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9786-220X</idno>
                  <affiliation ref="#struct-2071"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Carola</forename>
                    <surname>Doerr</surname>
                  </persName>
                  <email type="md5">d1b2e33c2d3f25d09951b4c49fa97770</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">carola-doerr</idno>
                  <idno type="idhal" notation="numeric">1290</idno>
                  <idno type="halauthorid" notation="string">17976-1290</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4981-3227</idno>
                  <idno type="IDREF">https://www.idref.fr/232603383</idno>
                  <affiliation ref="#struct-441569"/>
                  <affiliation ref="#struct-541718"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">10334</idno>
                <idno type="issn">0178-4617</idno>
                <idno type="eissn">1432-0541</idno>
                <title level="j">Algorithmica</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <biblScope unit="volume">80</biblScope>
                  <biblScope unit="pp">1658-1709</biblScope>
                  <date type="datePub">2018</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/s00453-017-0354-9</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ne">Computer Science [cs]/Neural and Evolutionary Computing [cs.NE]</classCode>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The (1 + (λ, λ)) genetic algorithm (GA) proposed in [Doerr, Doerr, and Ebel. From black-box complexity to designing new genetic algorithms. Theoretical Computer Science (2015)] is one of the few examples for which a super-constant speed-up of the expected optimization time through the use of crossover could be rigorously demonstrated. It was proven that the expected optimization time of this algorithm on OneMax is O(max{n log(n)/λ, λn}) for any offspring population size λ ∈ {1,. .. , n} (and the other parameters suitably dependent on λ) and it was shown experimentally that a self-adjusting choice of λ leads to a better, most likely linear, runtime. In this work, we study more precisely how the optimization time depends on the parameter choices, leading to the following results on how to optimally choose the population size, the mutation probability, and the crossover bias both in a static and a dynamic fashion. For the mutation probability and the crossover bias depending on λ as in [DDE15], we improve the previous runtime bound to O(max{n log(n)/λ, nλ log log(λ)/ log(λ)}). This expression is minimized by a value of λ slightly larger than what the previous result suggested and gives an expected optimization time of O n log(n) log log log(n)/ log log(n). We show that no static choice in the three-dimensional parameter space of offspring population, mutation probability, and crossover bias gives an asymp-totically better runtime. Results presented in this work are based on [12–14]. B. DoerrÉcole Doerr´DoerrÉcole Polytechnique, LIX-UMR 7161, We also prove that the self-adjusting parameter choice suggested in [DDE15] outperforms all static choices and yields the conjectured linear expected runtime. This is asymptotically optimal among all possible parameter choices.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-2071" status="VALID">
          <idno type="IdRef">196509955</idno>
          <idno type="ISNI">0000000403673665</idno>
          <idno type="RNSR">200519331V</idno>
          <idno type="ROR">https://ror.org/04afed728</idno>
          <idno type="Wikidata">Q16009025</idno>
          <orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
          <orgName type="acronym">LIX</orgName>
          <date type="start">2005-01-01</date>
          <desc>
            <address>
              <addrLine>1 Rue Honoré d’Estienne d’Orves, Bâtiment Alain Turing, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lix.polytechnique.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300340" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
            <relation name="UMR7161" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-541718" status="VALID">
          <orgName>Recherche Opérationnelle</orgName>
          <orgName type="acronym">RO</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300340" status="VALID">
          <idno type="IdRef">027309320</idno>
          <idno type="ISNI">0000000121581279</idno>
          <idno type="ROR">https://ror.org/05hy3tk52</idno>
          <idno type="Wikidata">Q273626</idno>
          <orgName>École polytechnique</orgName>
          <orgName type="acronym">X</orgName>
          <date type="start">1794-03-11</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91128 Palaiseau Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.polytechnique.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>