<?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-02478139</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-25T07:10:24+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Viet-Phuong</forename>
                <surname>Nguyen</surname>
              </persName>
              <idno type="halauthorid">1792580-0</idno>
              <affiliation ref="#struct-397050"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christian</forename>
                <surname>Prins</surname>
              </persName>
              <email type="md5">8525f35d8d36ad782aac3544e2986572</email>
              <email type="domain">utt.fr</email>
              <idno type="idhal" notation="numeric">952560</idno>
              <idno type="halauthorid" notation="string">802922-952560</idno>
              <affiliation ref="#struct-397050"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Caroline</forename>
                <surname>Prodhon</surname>
              </persName>
              <email type="md5">a5a25736c43bf50eda85c0c4715a8099</email>
              <email type="domain">utt.fr</email>
              <idno type="idhal" notation="string">caroline-prodhon</idno>
              <idno type="idhal" notation="numeric">952561</idno>
              <idno type="halauthorid" notation="string">802923-952561</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9653-1855</idno>
              <affiliation ref="#struct-397050"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Daniel</forename>
                <surname>Gavrysiak</surname>
              </persName>
              <email type="md5">ab090e09454839d257c16646434c9dd0</email>
              <email type="domain">utt.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2020-02-13 17:23:11</date>
              <date type="whenModified">2025-08-12 19:57:19</date>
              <date type="whenReleased">2020-02-13 17:23:11</date>
              <date type="whenProduced">2012-02</date>
              <ref type="externalLink" target="https://api.istex.fr/ark:/67375/6H6-1ZFWSX9F-G/fulltext.pdf?sid=hal"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="708963">
                <persName>
                  <forename>Daniel</forename>
                  <surname>Gavrysiak</surname>
                </persName>
                <email type="md5">ab090e09454839d257c16646434c9dd0</email>
                <email type="domain">utt.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02478139</idno>
            <idno type="halUri">https://utt.hal.science/hal-02478139</idno>
            <idno type="halBibtex">nguyen:hal-02478139</idno>
            <idno type="halRefHtml">&lt;i&gt;Engineering Applications of Artificial Intelligence&lt;/i&gt;, 2012, 25 (1), pp.56-71. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.engappai.2011.09.012"&gt;&amp;#x27E8;10.1016/j.engappai.2011.09.012&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Engineering Applications of Artificial Intelligence, 2012, 25 (1), pp.56-71. &amp;#x27E8;10.1016/j.engappai.2011.09.012&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-TROYES">Université de Technologie de Troyes</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="UTT">UTT</idno>
            <idno type="stamp" n="LOSI" corresp="UTT">LOSI</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">A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Viet-Phuong</forename>
                    <surname>Nguyen</surname>
                  </persName>
                  <idno type="halauthorid">1792580-0</idno>
                  <affiliation ref="#struct-397050"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christian</forename>
                    <surname>Prins</surname>
                  </persName>
                  <email type="md5">8525f35d8d36ad782aac3544e2986572</email>
                  <email type="domain">utt.fr</email>
                  <idno type="idhal" notation="numeric">952560</idno>
                  <idno type="halauthorid" notation="string">802922-952560</idno>
                  <affiliation ref="#struct-397050"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Caroline</forename>
                    <surname>Prodhon</surname>
                  </persName>
                  <email type="md5">a5a25736c43bf50eda85c0c4715a8099</email>
                  <email type="domain">utt.fr</email>
                  <idno type="idhal" notation="string">caroline-prodhon</idno>
                  <idno type="idhal" notation="numeric">952561</idno>
                  <idno type="halauthorid" notation="string">802923-952561</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9653-1855</idno>
                  <affiliation ref="#struct-397050"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">10960</idno>
                <idno type="issn">0952-1976</idno>
                <title level="j">Engineering Applications of Artificial Intelligence</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">25</biblScope>
                  <biblScope unit="issue">1</biblScope>
                  <biblScope unit="pp">56-71</biblScope>
                  <date type="datePub">2012-02</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.engappai.2011.09.012</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Path relinking</term>
                <term xml:lang="en">Iterated local search</term>
                <term xml:lang="en">Two-echelon location-routing problem</term>
                <term xml:lang="en">Facility location</term>
                <term xml:lang="en">Vehicle routing</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</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 two-echelon location-routing problem (LRP-2E) is raised by the design of transportation networks with two types of trips: first-level trips serving from one main depot a set of satellite depots, to be located, and second-level trips supplying customers from these satellites. In the proposed multi-start iterated local search (MS-ILS), three greedy randomized heuristics are used cyclically to get initial solutions. Each ILS run alternates between two search spaces: LRP-2E solutions, and travelling salesman (TSP) tours covering the main depot and the customers. The number of iterations allotted to a run is reduced whenever a known solution (stored in a tabu list) is revisited. MS-ILS can be reinforced by a path-relinking procedure (PR), used internally for intensification, as post-optimization, or both. On two sets with 24 and 30 LRP-2E instances, MS-ILS outperforms on average two GRASP algorithms and adding PR brings a further improvement. Our metaheuristic also surpasses a tabu search on 30 instances for a more general problem with several main depots. It is still effective on a particular case, the capacitated location-routing problem (CLRP): In a comparison with four published metaheuristics, only one (LRGTS, Prins et al., 2007) does better.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-397050" status="OLD">
          <orgName>Laboratoire d'Optimisation des Systèmes Industriels</orgName>
          <orgName type="acronym">LOSI</orgName>
          <date type="start">1996-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>12 rue Marie Curie, F-10010 Troyes</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://losi.utt.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-116261" type="direct"/>
            <relation active="#struct-93484" type="indirect"/>
            <relation name="UMR6281" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-116261" status="OLD">
          <idno type="RNSR">201019052V</idno>
          <orgName>Institut Charles Delaunay</orgName>
          <orgName type="acronym">ICD</orgName>
          <date type="start">2006-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>12, rue Marie Curie BP 2060 - 10010 Troyes Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://icd.utt.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93484" type="direct"/>
            <relation name="UMR6281" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93484" status="VALID">
          <idno type="ROR">https://ror.org/01qhqcj41</idno>
          <orgName>Université de Technologie de Troyes</orgName>
          <orgName type="acronym">UTT</orgName>
          <desc>
            <address>
              <addrLine>12 rue Marie CurieCS 4206010004 TROYES CEDEX</addrLine>
              <country key="FR"/>
            </address>
          </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>