<?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-01586879</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-20T01:45:25+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Memetic algorithm for solving one-to-one shortest path problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Omar</forename>
                <surname>Dib</surname>
              </persName>
              <idno type="halauthorid">1168448-0</idno>
              <affiliation ref="#struct-363822"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Alexandre</forename>
                <surname>Caminada</surname>
              </persName>
              <idno type="halauthorid">307810-0</idno>
              <affiliation ref="#struct-300261"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Marie-Ange</forename>
                <surname>Manier</surname>
              </persName>
              <idno type="halauthorid">312431-0</idno>
              <affiliation ref="#struct-300261"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Omar</forename>
                <surname>DIB</surname>
              </persName>
              <email type="md5">1d9f19950ce762727c49a248ea5268f5</email>
              <email type="domain">hotmail.com</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-09-13 13:43:51</date>
              <date type="whenModified">2024-04-23 03:12:50</date>
              <date type="whenReleased">2017-09-13 17:26:41</date>
              <date type="whenProduced">2015-02-25</date>
              <date type="whenEndEmbargoed">2017-09-13</date>
              <ref type="file" target="https://hal.science/hal-01586879v1/document">
                <date notBefore="2017-09-13"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01586879v1/file/ROADEF%20OmarDIB%20-%20Corrections.pdf" id="file-1586879-1638916">
                <date notBefore="2017-09-13"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="481699">
                <persName>
                  <forename>Omar</forename>
                  <surname>DIB</surname>
                </persName>
                <email type="md5">1d9f19950ce762727c49a248ea5268f5</email>
                <email type="domain">hotmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01586879</idno>
            <idno type="halUri">https://hal.science/hal-01586879</idno>
            <idno type="halBibtex">dib:hal-01586879</idno>
            <idno type="halRefHtml">&lt;i&gt;16ème conférence de la Société Française de Recherche Opérationnelle et Aide à la Décision (ROADEF 2015)&lt;/i&gt;, Aix-Marseille Université, Feb 2015, Marseille, France</idno>
            <idno type="halRef">16ème conférence de la Société Française de Recherche Opérationnelle et Aide à la Décision (ROADEF 2015), Aix-Marseille Université, Feb 2015, Marseille, France</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1586879-1638916"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-BM">Université de Technologie de Belfort-Montbeliard</idno>
            <idno type="stamp" n="UNIV-BM-THESE">Université de Technologie de Belfort-Montbeliard</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="IRT-SYSTEMX">IRT SystemX</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="0">No</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Memetic algorithm for solving one-to-one shortest path problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Omar</forename>
                    <surname>Dib</surname>
                  </persName>
                  <idno type="halauthorid">1168448-0</idno>
                  <affiliation ref="#struct-363822"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Alexandre</forename>
                    <surname>Caminada</surname>
                  </persName>
                  <idno type="halauthorid">307810-0</idno>
                  <affiliation ref="#struct-300261"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Marie-Ange</forename>
                    <surname>Manier</surname>
                  </persName>
                  <idno type="halauthorid">312431-0</idno>
                  <affiliation ref="#struct-300261"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>16ème conférence de la  Société Française de Recherche Opérationnelle et Aide à la Décision (ROADEF 2015)</title>
                  <date type="start">2015-02-25</date>
                  <date type="end">2015-02-27</date>
                  <settlement>Marseille</settlement>
                  <country key="FR">France</country>
                </meeting>
                <respStmt>
                  <resp>conferenceOrganizer</resp>
                  <name>Aix-Marseille Université</name>
                </respStmt>
                <imprint/>
              </monogr>
              <ref type="publisher">http://roadef2015.lsis.org/</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">optimization</term>
                <term xml:lang="en">meta-heuristics</term>
                <term xml:lang="en">exact algorithms</term>
                <term xml:lang="en">Shortest path</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halDomain" n="math">Mathematics [math]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The shortest path problem (SPP) is widely applied in different fields of application such as transportation, telecommunication and networks. It aims at determining the path between two points with the minimum associated/allocated resource (distance, time, cost…) in a directed or undirected graph. SPP has been well studied over the last 60 years, graph theory experts still endeavor to extract new variants of the basic problem in order to model and provide efficient solutions for several real life issues. Important forms of the SPP may be considered such as finding the shortest paths in a dynamic graph where the arcs’ weights vary as functions of time. Moreover, finding shortest paths subject to some additional constraints like fixing the maximum number of visited nodes or precising the nodes’ types, colors, etc.To deal with the SPP and its different variants, several algorithms have been developed since 1956.  The standard solution to the one-to-one shortest path problem, which is the target of our study, is Dijkstra’s algorithm [1]. Its running time depends on the selected data structure. For the average case, one can get an O (|E|+|V|*log|V|) (|V| #Vertices, |E| #Edges). To deal with negative edge weight, we have the Bellman-Ford algorithm. SPP was also solved using MILP technique but its running time is usually higher than standard algorithms. MILP is widely used for solving many variants of SPP when standard algorithms fail for a lack of flexibility to cope with additional constraints but this usually leads to a significant execution time. In practice, several speed-up techniques have been proposed to reduce the search space such as bidirectional search, A* algorithm, preprocessing techniques, etc. Although, those techniques are efficient and fast enough, they become less performant when the size of the network becomes very large or when additional constraints are added such as dynamic arcs weight, multi-criteria paths optimization. To overcome such shortcomings, we believe that meta-heuristics such as GA, local search may be efficient candidates to give near optimal solutions within acceptable time.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-363822" status="VALID">
          <idno type="ROR">https://ror.org/03crmsn52</idno>
          <orgName>IRT SystemX</orgName>
          <desc>
            <address>
              <addrLine>Institut de recherche technologique SystemX - 8 Avenue de la Vauve, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.irt-systemx.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300261" status="VALID">
          <orgName>Université de Technologie de Belfort-Montbeliard</orgName>
          <orgName type="acronym">UTBM</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>