<?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-02076619</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-21T17:45:51+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Proper balance between search towards and along Pareto front: biobjective TSP case study</title>
            <author role="aut">
              <persName>
                <forename type="first">Andrzej</forename>
                <surname>Jaszkiewicz</surname>
              </persName>
              <idno type="halauthorid">451017-0</idno>
              <affiliation ref="#struct-26960"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Thibaut</forename>
                <surname>Lust</surname>
              </persName>
              <email type="md5">47f3b4f444578855bc46b75b2c3a9826</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">thibaut-lust</idno>
              <idno type="idhal" notation="numeric">9601</idno>
              <idno type="halauthorid" notation="string">26126-9601</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8433-518X</idno>
              <idno type="IDREF">https://www.idref.fr/227332105</idno>
              <affiliation ref="#struct-394573"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Thibaut</forename>
                <surname>Lust</surname>
              </persName>
              <email type="md5">47f3b4f444578855bc46b75b2c3a9826</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-03-22 11:36:15</date>
              <date type="whenModified">2023-04-11 15:16:28</date>
              <date type="whenReleased">2019-03-22 11:36:15</date>
              <date type="whenProduced">2017-07</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="449546">
                <persName>
                  <forename>Thibaut</forename>
                  <surname>Lust</surname>
                </persName>
                <email type="md5">47f3b4f444578855bc46b75b2c3a9826</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02076619</idno>
            <idno type="halUri">https://hal.sorbonne-universite.fr/hal-02076619</idno>
            <idno type="halBibtex">jaszkiewicz:hal-02076619</idno>
            <idno type="halRefHtml">&lt;i&gt;Annals of Operations Research&lt;/i&gt;, 2017, 254 (1-2), pp.111-130. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s10479-017-2415-5"&gt;&amp;#x27E8;10.1007/s10479-017-2415-5&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Annals of Operations Research, 2017, 254 (1-2), pp.111-130. &amp;#x27E8;10.1007/s10479-017-2415-5&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</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">Proper balance between search towards and along Pareto front: biobjective TSP case study</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Andrzej</forename>
                    <surname>Jaszkiewicz</surname>
                  </persName>
                  <idno type="halauthorid">451017-0</idno>
                  <affiliation ref="#struct-26960"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Thibaut</forename>
                    <surname>Lust</surname>
                  </persName>
                  <email type="md5">47f3b4f444578855bc46b75b2c3a9826</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">thibaut-lust</idno>
                  <idno type="idhal" notation="numeric">9601</idno>
                  <idno type="halauthorid" notation="string">26126-9601</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8433-518X</idno>
                  <idno type="IDREF">https://www.idref.fr/227332105</idno>
                  <affiliation ref="#struct-394573"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">10496</idno>
                <idno type="issn">0254-5330</idno>
                <idno type="eissn">1572-9338</idno>
                <title level="j">Annals of Operations Research</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <biblScope unit="volume">254</biblScope>
                  <biblScope unit="issue">1-2</biblScope>
                  <biblScope unit="pp">111-130</biblScope>
                  <date type="datePub">2017-07</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/s10479-017-2415-5</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="scco.comp">Cognitive science/Computer science</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>In this paper we propose simple yet efficient version of the two-phase Pareto local search (2PPLS) for solving the biobjective traveling salesman problem (bTSP). In the first phase the powerful Lin–Kernighan heuristic is used to generate some high quality solutions being very close to the Pareto front. Then Pareto local search is used to generate more potentially Pareto efficient solutions along the Pareto front. Instead of previously used method of Aneja and Nair we use uniformly distributed weight vectors in the first phase. We show experimentally that properly balancing the computational effort in the first and second phase we can obtain results better than previous versions of 2PPLS for bTSP and at least comparable to the state-of-the art results of more complex MOMAD method. Furthermore, we propose a simple extension of 2PPLS where some additional solutions are generated by Lin–Kernighan heuristic during the run of PLS. In this way we obtain a method that is more robust with respect to the number of initial solutions generated in the first phase.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-26960" status="VALID">
          <orgName>Institute of Computing Science [Poznan]</orgName>
          <desc>
            <address>
              <addrLine>ul. Piotrowo 2, 60-965 Poznan, Poland</addrLine>
              <country key="PL"/>
            </address>
            <ref type="url">http://www2.cs.put.poznan.pl/en/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-54173" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-394573" status="OLD">
          <orgName>DECISION</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-54173" status="VALID">
          <idno type="ROR">https://ror.org/00p7p3302</idno>
          <orgName>Poznan University of Technology</orgName>
          <orgName type="acronym">PUT</orgName>
          <desc>
            <address>
              <addrLine>Pl. M. Skłodowskiej-Curie 5 5 M. Skłodowska-Curie Square 60-965 Poznan</addrLine>
              <country key="PL"/>
            </address>
            <ref type="url">http://www.put.poznan.pl/en</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</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-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </desc>
        </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>
      </listOrg>
    </back>
  </text>
</TEI>