<?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-02490366</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-19T00:04:29+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">An effective memetic algorithm for the cumulative capacitated vehicle routing problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Sandra Ulrich</forename>
                <surname>Ngueveu</surname>
              </persName>
              <email type="md5">9d692da5d601b55c8e176b4f02725e29</email>
              <email type="domain">laas.fr</email>
              <idno type="idhal" notation="string">sandra-ulrich-ngueveu</idno>
              <idno type="idhal" notation="numeric">4285</idno>
              <idno type="halauthorid" notation="string">18600-4285</idno>
              <idno type="IDREF">https://www.idref.fr/146180526</idno>
              <idno type="ORCID">https://orcid.org/0009-0002-4353-2106</idno>
              <orgName ref="#struct-395452"/>
              <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">Roberto</forename>
                <surname>Wolfler Calvo</surname>
              </persName>
              <email type="md5">d0ccd9e4a6563de729843dd9fa3b96ab</email>
              <email type="domain">lipn.univ-paris13.fr</email>
              <idno type="idhal" notation="numeric">879728</idno>
              <idno type="halauthorid" notation="string">493521-879728</idno>
              <affiliation ref="#struct-994"/>
            </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-25 10:37:03</date>
              <date type="whenModified">2025-08-12 19:57:21</date>
              <date type="whenReleased">2020-02-25 10:37:03</date>
              <date type="whenProduced">2010-11</date>
              <ref type="externalLink" target="https://api.istex.fr/ark:/67375/6H6-V84LXHBS-3/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-02490366</idno>
            <idno type="halUri">https://utt.hal.science/hal-02490366</idno>
            <idno type="halBibtex">ngueveu:hal-02490366</idno>
            <idno type="halRefHtml">&lt;i&gt;Computers and Operations Research&lt;/i&gt;, 2010, 37 (11), pp.1877-1885. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.cor.2009.06.014"&gt;&amp;#x27E8;10.1016/j.cor.2009.06.014&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Computers and Operations Research, 2010, 37 (11), pp.1877-1885. &amp;#x27E8;10.1016/j.cor.2009.06.014&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-PARIS13">Université Paris-Nord - Paris XIII </idno>
            <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="OCA">Observatoire de la Cote d'Azur</idno>
            <idno type="stamp" n="LIPN" corresp="UNIV-PARIS13">Laboratoire d'Informatique de Paris-Nord</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="GALILE" corresp="UNIV-PARIS13">Institut Galilée Université Paris 13</idno>
            <idno type="stamp" n="UTT">UTT</idno>
            <idno type="stamp" n="SORBONNE-PARIS-NORD">Université Sorbonne Paris Nord</idno>
            <idno type="stamp" n="CONFRENCE-NATIONALE-SUR-LES-APPLICATIONS-PRATIQUES-DE-LINTELLIGENCE-ARTIFICIELLE" corresp="CNRS">Conférence Nationale sur les Applications Pratiques de l’Intelligence Artificielle </idno>
            <idno type="stamp" n="LOSI" corresp="UTT">LOSI</idno>
            <idno type="stamp" n="ACT-R" corresp="UNIV-PARIS13">Act'R </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">An effective memetic algorithm for the cumulative capacitated vehicle routing problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sandra Ulrich</forename>
                    <surname>Ngueveu</surname>
                  </persName>
                  <email type="md5">9d692da5d601b55c8e176b4f02725e29</email>
                  <email type="domain">laas.fr</email>
                  <idno type="idhal" notation="string">sandra-ulrich-ngueveu</idno>
                  <idno type="idhal" notation="numeric">4285</idno>
                  <idno type="halauthorid" notation="string">18600-4285</idno>
                  <idno type="IDREF">https://www.idref.fr/146180526</idno>
                  <idno type="ORCID">https://orcid.org/0009-0002-4353-2106</idno>
                  <orgName ref="#struct-395452"/>
                  <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">Roberto</forename>
                    <surname>Wolfler Calvo</surname>
                  </persName>
                  <email type="md5">d0ccd9e4a6563de729843dd9fa3b96ab</email>
                  <email type="domain">lipn.univ-paris13.fr</email>
                  <idno type="idhal" notation="numeric">879728</idno>
                  <idno type="halauthorid" notation="string">493521-879728</idno>
                  <affiliation ref="#struct-994"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">12050</idno>
                <idno type="issn">0305-0548</idno>
                <idno type="eissn">1873-765X</idno>
                <title level="j">Computers and Operations Research</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">37</biblScope>
                  <biblScope unit="issue">11</biblScope>
                  <biblScope unit="pp">1877-1885</biblScope>
                  <date type="datePub">2010-11</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.cor.2009.06.014</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Memetic algorithm</term>
                <term xml:lang="en">Routing for relief</term>
                <term xml:lang="en">Traveling repairman problem</term>
                <term xml:lang="en">Cumulative capacitated vehicle routing problem</term>
                <term xml:lang="en">Metaheuristic</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</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 cumulative capacitated vehicle routing problem (CCVRP) is a transportation problem which occurs when the objective is to minimize the sum of arrival times at customers, instead of the classical route length, subject to vehicle capacity constraints. This type of challenges arises whenever priority is given to the satisfaction of the customer need, e.g. vital goods supply or rescue after a natural disaster. The CCVRP generalizes the NP-hard traveling repairman problem (TRP), by adding capacity constraints and a homogeneous vehicle fleet. This paper presents the first upper and lower bounding procedures for this new problem. The lower bounds are derived from CCVRP properties. Upper bounds are given by a memetic algorithm using non-trivial evaluations of cost variations in the local search. Good results are obtained not only on the CCVRP, but also on the special case of the TRP, outperforming the only TRP metaheuristic published.</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-994" status="OLD">
          <orgName>Laboratoire d'Informatique de Paris-Nord</orgName>
          <orgName type="acronym">LIPN</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Institut Galilée, Université Paris 13, 99 avenue Jean-Baptiste Clément, F-93430, Villetaneuse</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www-lipn.univ-paris13.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-15786" type="direct"/>
            <relation active="#struct-301340" type="direct"/>
            <relation active="#struct-303171" type="direct"/>
            <relation name="UMR7030" active="#struct-441569" type="direct"/>
          </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>
        <org type="institution" xml:id="struct-15786" status="VALID">
          <idno type="ROR">https://ror.org/05f82e368</idno>
          <orgName>Université Paris 13</orgName>
          <orgName type="acronym">UP13</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-paris13.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301340" status="VALID">
          <orgName>Institut Galilée</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-303171" status="VALID">
          <idno type="IdRef">19077990X</idno>
          <idno type="ROR">https://ror.org/001z21q04</idno>
          <orgName>Université Sorbonne Paris Cité</orgName>
          <orgName type="acronym">USPC</orgName>
          <date type="start">2010-01-01</date>
          <desc>
            <address>
              <addrLine>Université Sorbonne Paris Cité | 100-104, avenue de France | 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-paris-cite.fr/fr</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>