<?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-04033231</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-15T05:04:51+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">MOOP: An Efficient Utility-Rich Route Planning Framework Over Two-Fold Time-Dependent Road Networks</title>
            <author role="aut">
              <persName>
                <forename type="first">Liping</forename>
                <surname>Gao</surname>
              </persName>
              <email type="md5">3fc036f06c8dac5e328325ce69bc5845</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="numeric">1128908</idno>
              <idno type="halauthorid" notation="string">885343-1128908</idno>
              <idno type="IDREF">https://www.idref.fr/275097579</idno>
              <idno type="VIAF">https://viaf.org/viaf/93170858302207681423</idno>
              <affiliation ref="#struct-1042359"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Chao</forename>
                <surname>Chen</surname>
              </persName>
              <email type="md5">04bb54f6a3b22ba823665d0598d45298</email>
              <email type="domain">eng.monash.edu.au</email>
              <idno type="idhal" notation="numeric">868123</idno>
              <idno type="halauthorid" notation="string">300712-868123</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2094-9734</idno>
              <affiliation ref="#struct-440580"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Feng</forename>
                <surname>Chu</surname>
              </persName>
              <email type="md5">0062bdd1e90600a53d1dbcc629c6c619</email>
              <email type="domain">utt.fr</email>
              <idno type="idhal" notation="numeric">756544</idno>
              <idno type="halauthorid" notation="string">145281-756544</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-1225-8319</idno>
              <idno type="IDREF">https://www.idref.fr/08607976X</idno>
              <idno type="VIAF">https://viaf.org/viaf/173643282</idno>
              <idno type="ISNI">http://isni.org/isni/0000000430865515</idno>
              <affiliation ref="#struct-1042359"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Chengwu</forename>
                <surname>Liao</surname>
              </persName>
              <idno type="idhal" notation="numeric">1238259</idno>
              <idno type="halauthorid" notation="string">2414185-1238259</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-5098-4579</idno>
              <affiliation ref="#struct-440580"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hongyu</forename>
                <surname>Huang</surname>
              </persName>
              <idno type="idhal" notation="numeric">1238260</idno>
              <idno type="halauthorid" notation="string">2389905-1238260</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9052-4868</idno>
              <affiliation ref="#struct-440580"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Yasha</forename>
                <surname>Wang</surname>
              </persName>
              <idno type="halauthorid">985290-0</idno>
              <affiliation ref="#struct-1156746"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Frédéric</forename>
                <surname>Davesne</surname>
              </persName>
              <email type="md5">fbe1d4bbaa9c5be84347d1c31a63a07a</email>
              <email type="domain">univ-evry.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-03-16 23:38:26</date>
              <date type="whenModified">2025-04-17 10:06:02</date>
              <date type="whenReleased">2023-03-16 23:38:26</date>
              <date type="whenProduced">2023-10</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="127748">
                <persName>
                  <forename>Frédéric</forename>
                  <surname>Davesne</surname>
                </persName>
                <email type="md5">fbe1d4bbaa9c5be84347d1c31a63a07a</email>
                <email type="domain">univ-evry.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04033231</idno>
            <idno type="halUri">https://hal.science/hal-04033231</idno>
            <idno type="halBibtex">gao:hal-04033231</idno>
            <idno type="halRefHtml">&lt;i&gt; IEEE Transactions on Emerging Topics in Computational Intelligence&lt;/i&gt;, 2023, 7 (5), pp.1554--1570. &lt;a target="_blank" href="https://dx.doi.org/10.1109/TETCI.2023.3241930"&gt;&amp;#x27E8;10.1109/TETCI.2023.3241930&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef"> IEEE Transactions on Emerging Topics in Computational Intelligence, 2023, 7 (5), pp.1554--1570. &amp;#x27E8;10.1109/TETCI.2023.3241930&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-EVRY">Université d'Evry-Val d'Essonne</idno>
            <idno type="stamp" n="IBISC" corresp="UNIV-EVRY">Informatique, Biologie Intégrative et Systèmes Complexes</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="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-EVRY-SACLAY" corresp="UNIV-PARIS-SACLAY">UNIV-EVRY-SACLAY</idno>
            <idno type="stamp" n="IBISC-SIAM" corresp="IBISC">SIAM - Signal, Image et AutoMatique</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="GS-LIFE-SCIENCES-HEALTH" corresp="UNIVERSITE-PARIS-SACLAY">Graduate School Life Sciences and Health</idno>
            <idno type="stamp" n="GS-SPORT-HUMAN-MOVEMENT">Graduate School Sport, Mouvement, Facteurs Humains</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">MOOP: An Efficient Utility-Rich Route Planning Framework Over Two-Fold Time-Dependent Road Networks</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Liping</forename>
                    <surname>Gao</surname>
                  </persName>
                  <email type="md5">3fc036f06c8dac5e328325ce69bc5845</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="numeric">1128908</idno>
                  <idno type="halauthorid" notation="string">885343-1128908</idno>
                  <idno type="IDREF">https://www.idref.fr/275097579</idno>
                  <idno type="VIAF">https://viaf.org/viaf/93170858302207681423</idno>
                  <affiliation ref="#struct-1042359"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Chao</forename>
                    <surname>Chen</surname>
                  </persName>
                  <email type="md5">04bb54f6a3b22ba823665d0598d45298</email>
                  <email type="domain">eng.monash.edu.au</email>
                  <idno type="idhal" notation="numeric">868123</idno>
                  <idno type="halauthorid" notation="string">300712-868123</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2094-9734</idno>
                  <affiliation ref="#struct-440580"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Feng</forename>
                    <surname>Chu</surname>
                  </persName>
                  <email type="md5">0062bdd1e90600a53d1dbcc629c6c619</email>
                  <email type="domain">utt.fr</email>
                  <idno type="idhal" notation="numeric">756544</idno>
                  <idno type="halauthorid" notation="string">145281-756544</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-1225-8319</idno>
                  <idno type="IDREF">https://www.idref.fr/08607976X</idno>
                  <idno type="VIAF">https://viaf.org/viaf/173643282</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000430865515</idno>
                  <affiliation ref="#struct-1042359"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Chengwu</forename>
                    <surname>Liao</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1238259</idno>
                  <idno type="halauthorid" notation="string">2414185-1238259</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-5098-4579</idno>
                  <affiliation ref="#struct-440580"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hongyu</forename>
                    <surname>Huang</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1238260</idno>
                  <idno type="halauthorid" notation="string">2389905-1238260</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9052-4868</idno>
                  <affiliation ref="#struct-440580"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Yasha</forename>
                    <surname>Wang</surname>
                  </persName>
                  <idno type="halauthorid">985290-0</idno>
                  <affiliation ref="#struct-1156746"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">117995</idno>
                <idno type="issn">2471-285X</idno>
                <title level="j"> IEEE Transactions on Emerging Topics in Computational Intelligence</title>
                <imprint>
                  <publisher>Institute of Electrical and Electronics Engineers</publisher>
                  <biblScope unit="volume">7</biblScope>
                  <biblScope unit="issue">5</biblScope>
                  <biblScope unit="pp">1554--1570</biblScope>
                  <date type="datePub">2023-10</date>
                  <date type="dateEpub">2023-02-28</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1109/TETCI.2023.3241930</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Planning</term>
                <term xml:lang="en">Utility</term>
                <term xml:lang="en">Two-fold</term>
                <term xml:lang="en">Travel time</term>
                <term xml:lang="en">Time-dependent</term>
                <term xml:lang="en">Route planning</term>
                <term xml:lang="en">Roads</term>
                <term xml:lang="en">Road network</term>
                <term xml:lang="en">Real-time systems</term>
                <term xml:lang="en">Heuristic algorithms</term>
                <term xml:lang="en">Data structures</term>
                <term xml:lang="en">Costs</term>
                <term xml:lang="en">Computational intelligence</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>Utility-rich (e.g., more attractive or safer) route planning on city-scale road networks is a common yet time-consuming task. Although both travel time and utility on edges are time-dependent concurrently in real cases, they are overlooked in most prior work. In this paper, we focus on the route planning over two-fold time-dependent road networks, i.e., both travel time and utility on edges are varying over time. We aim to find a route from an origin to a destination by maximizing the accumulated utility score within a time budget. Moreover, to satisfy users' real-time requests, the fast response is usually mandatory. Here, we propose a novel two-phase framework called , i.e., anaging ffline data for nline route lanning, to discover the near-optimal driving routes efficiently. Specifically, in the offline phase, we construct the auxiliary data structure, i.e., the edge table, to manage the time-dependent information about edges. In the following online phase, the route is generated sequentially by an iterative edge table visiting process. We evaluate the proposed thoroughly based on synthetic road networks and two real-world road networks in the city of Chengdu (4,819 nodes and 6,385 edges) and the city of Chongqing (5,056 nodes and 7,355 edges) in China. Results show that: (i) our framework can work adaptively for different time-varying utility patterns; (ii) the edge table is economic yet effective; (iii) our route planning algorithm outperforms other baselines in obtaining the highest utility value while costing the least running time.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1042359" status="VALID">
          <idno type="IdRef">201055902</idno>
          <idno type="RNSR">201019077X</idno>
          <idno type="ROR">https://ror.org/01aqxgr98</idno>
          <idno type="Wikidata">Q51781503</idno>
          <orgName>Informatique, BioInformatique, Systèmes Complexes</orgName>
          <orgName type="acronym">IBISC</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>40,rue du pelvoux, Courcouronnes 91020 EVRY CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ibisc.univ-evry.fr/</ref>
          </desc>
          <listRelation>
            <relation name="EA4526" active="#struct-300306" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-440580" status="VALID">
          <orgName>College of Computer and Information Science [Chongqing]</orgName>
          <desc>
            <address>
              <addrLine>Southwest University of China, Chongqing 400715 China</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">http://www.cs.cqu.edu.cn/en/about</ref>
          </desc>
          <listRelation>
            <relation active="#struct-463368" type="direct"/>
          </listRelation>
        </org>
        <org type="department" xml:id="struct-1156746" status="INCOMING">
          <orgName>School of Computer Science</orgName>
          <desc>
            <address>
              <country key="CN"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-300884" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300306" status="VALID">
          <idno type="IdRef">030820529</idno>
          <idno type="ISNI">0000000121805818</idno>
          <idno type="ROR">https://ror.org/00e96v939</idno>
          <idno type="Wikidata">Q1531014</idno>
          <orgName>Université d'Évry-Val-d'Essonne</orgName>
          <orgName type="acronym">UEVE</orgName>
          <date type="start">1991-07-22</date>
          <desc>
            <address>
              <addrLine>Boulevard François Mitterrand 91025 Evry Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-evry.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-419361" status="VALID">
          <idno type="IdRef">241345251</idno>
          <idno type="ROR">https://ror.org/03xjwb503</idno>
          <orgName>Université Paris-Saclay</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment Bréguet, 3 Rue Joliot Curie 2e ét, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-paris-saclay.fr/fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-463368" status="VALID">
          <idno type="ROR">https://ror.org/023rhb549</idno>
          <orgName>Southwest University [Chongqing]</orgName>
          <date type="start">2016-09-13</date>
          <desc>
            <address>
              <addrLine>2 Tiansheng Rd, Beibei Qu, Chongqing Shi, China, 400700</addrLine>
              <country key="CN"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300884" status="VALID">
          <idno type="ROR">https://ror.org/02v51f717</idno>
          <orgName>Peking University [Beijing]</orgName>
          <desc>
            <address>
              <addrLine>No.5 Yiheyuan Road Haidian District, Beijing, P.R.China 100871</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">http://english.pku.edu.cn/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>