<?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-01944039</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-25T13:54:47+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Luciano</forename>
                <surname>Costa</surname>
              </persName>
              <idno type="halauthorid">1472530-0</idno>
              <affiliation ref="#struct-53681"/>
            </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-541708"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Raphael</forename>
                <surname>Kramer</surname>
              </persName>
              <idno type="halauthorid">1472531-0</idno>
              <affiliation ref="#struct-203954"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Anand</forename>
                <surname>Subramanian</surname>
              </persName>
              <email type="md5">a7c983185523f1438aa41c510bc9de5a</email>
              <email type="domain">ct.ufpb.br</email>
              <idno type="idhal" notation="numeric">952548</idno>
              <idno type="halauthorid" notation="string">704002-952548</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9244-9969</idno>
              <affiliation ref="#struct-310827"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Gestionnaire</forename>
                <surname>HAL-UPMC</surname>
              </persName>
              <email type="md5">5e5f92b30d5a5dc773d73b514d0dc0a4</email>
              <email type="domain">upmc.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-12-04 13:38:16</date>
              <date type="whenModified">2025-04-14 14:08:02</date>
              <date type="whenReleased">2018-12-11 15:52:05</date>
              <date type="whenProduced">2018-10</date>
              <date type="whenEndEmbargoed">2019-04-05</date>
              <ref type="file" target="https://hal.sorbonne-universite.fr/hal-01944039v1/document">
                <date notBefore="2019-04-05"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.sorbonne-universite.fr/hal-01944039v1/file/paper-bprp-Lust.pdf" id="file-1944039-1969677">
                <date notBefore="2019-04-05"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="320703">
                <persName>
                  <forename>Gestionnaire</forename>
                  <surname>HAL-UPMC</surname>
                </persName>
                <email type="md5">5e5f92b30d5a5dc773d73b514d0dc0a4</email>
                <email type="domain">upmc.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01944039</idno>
            <idno type="halUri">https://hal.sorbonne-universite.fr/hal-01944039</idno>
            <idno type="halBibtex">costa:hal-01944039</idno>
            <idno type="halRefHtml">&lt;i&gt;Networks&lt;/i&gt;, 2018, 72 (3), pp.311-336</idno>
            <idno type="halRef">Networks, 2018, 72 (3), pp.311-336</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1944039-1969677"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <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="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">A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Luciano</forename>
                    <surname>Costa</surname>
                  </persName>
                  <idno type="halauthorid">1472530-0</idno>
                  <affiliation ref="#struct-53681"/>
                </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-541708"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Raphael</forename>
                    <surname>Kramer</surname>
                  </persName>
                  <idno type="halauthorid">1472531-0</idno>
                  <affiliation ref="#struct-203954"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Anand</forename>
                    <surname>Subramanian</surname>
                  </persName>
                  <email type="md5">a7c983185523f1438aa41c510bc9de5a</email>
                  <email type="domain">ct.ufpb.br</email>
                  <idno type="idhal" notation="numeric">952548</idno>
                  <idno type="halauthorid" notation="string">704002-952548</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9244-9969</idno>
                  <affiliation ref="#struct-310827"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">17359</idno>
                <idno type="issn">0028-3045</idno>
                <idno type="eissn">1097-0037</idno>
                <title level="j">Networks</title>
                <imprint>
                  <publisher>Wiley</publisher>
                  <biblScope unit="volume">72</biblScope>
                  <biblScope unit="issue">3</biblScope>
                  <biblScope unit="pp">311-336</biblScope>
                  <date type="datePub">2018-10</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">pollution‐routing problem</term>
                <term xml:lang="en">Pareto local search</term>
                <term xml:lang="en">multi‐objective optimization</term>
                <term xml:lang="en">heuristics</term>
                <term xml:lang="en">combinatorial optimization</term>
              </keywords>
              <classCode scheme="halDomain" n="math">Mathematics [math]</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</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>This article deals with the bi‐objective pollution‐routing problem (bPRP), a vehicle routing variant that arises in the context of green logistics. The two conflicting objectives considered are the minimization of the CO2 emissions and the costs related to driver's wages. A multi‐objective approach based on the two‐phase Pareto local search heuristic is employed to generate a good approximation of the Pareto front. During the first phase of the method, a first set of potentially efficient solutions is obtained by solving a series of weighted sum problems with an efficient heuristic originally developed to solve the single‐objective PRP. A dichotomous scheme is used to generate the different weight sets in an automatic way. In the second phase, the set is improved with an efficient Pareto local search (PLS) procedure. The use of PLS allows to limit the number of computational demanding weighted sum problems solved in the first phase, while keeping high‐quality results. Extensive computational experiments over existing benchmark instances show that the proposed approach leads to better results in less CPU time when compared to those obtained by state‐of‐the‐art methods.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="department" xml:id="struct-53681" status="VALID">
          <orgName>Département de Mathématiques et de Génie Industriel</orgName>
          <orgName type="acronym">MAGI</orgName>
          <desc>
            <address>
              <addrLine>C.P. 6079, succ. Centre-ville, MONTREAL (Québec) H3C 3A7</addrLine>
              <country key="CA"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-57241" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-541708" status="VALID">
          <orgName>DECISION</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-203954" status="VALID">
          <orgName>Università degli Studi di Modena e Reggio Emilia = University of Modena and Reggio Emilia</orgName>
          <orgName type="acronym">UNIMORE</orgName>
          <date type="start">1175-01-01</date>
          <desc>
            <address>
              <addrLine>41121 Modena / 42121 Reggio Emilia</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">https://www.unimore.it/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-310827" status="VALID">
          <idno type="ISNI">0000 0001 2158 2060</idno>
          <idno type="ROR">https://ror.org/00p9vpz11</idno>
          <orgName>Universidade Federal da Paraiba / Federal University of Paraiba</orgName>
          <orgName type="acronym">UFPB</orgName>
          <date type="start">1955-01-01</date>
          <desc>
            <address>
              <addrLine>Campus I - Lot. Cidade Universitaria, PB, 58051-900</addrLine>
              <country key="BR"/>
            </address>
            <ref type="url">https://www.ufpb.br/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-57241" status="VALID">
          <idno type="ROR">https://ror.org/05f8d4e86</idno>
          <orgName>École Polytechnique de Montréal</orgName>
          <orgName type="acronym">EPM</orgName>
          <desc>
            <address>
              <addrLine>Campus de l'Université de Montréal - 2500, chemin de Polytechnique - Montréal (Québec) H3T 1J4</addrLine>
              <country key="CA"/>
            </address>
            <ref type="url">http://www.polymtl.ca/</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>
        <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>