https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Li_et_al_2020dLi et al 2020d - Revision history2026-04-10T15:57:53ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Li_et_al_2020d&diff=202453&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 694115277 to Li et al 2020d2021-02-02T05:56:30Z<p>Scipediacontent moved page <a href="/public/Draft_Content_694115277" class="mw-redirect" title="Draft Content 694115277">Draft Content 694115277</a> to <a href="/public/Li_et_al_2020d" title="Li et al 2020d">Li et al 2020d</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 05:56, 2 February 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Li_et_al_2020d&diff=202452&oldid=prevScipediacontent: Created page with " == Abstract == We investigate the problem of optimal route planning for massive-scale trips: Given a traffic-aware road network and a set of trip queries Q, we aim to find a..."2021-02-02T05:56:22Z<p>Created page with " == Abstract == We investigate the problem of optimal route planning for massive-scale trips: Given a traffic-aware road network and a set of trip queries Q, we aim to find a..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
We investigate the problem of optimal route planning for massive-scale trips: Given a traffic-aware road network and a set of trip queries Q, we aim to find a route for each trip such that the global travel time cost for all queries in Q is minimized. Our problem is designed for a range of applications such as traffic-flow management, route planning and congestion prevention in rush hours. The exact algorithm bears exponential time complexity and is computationally prohibitive for application scenarios in dynamic traffic networks. To address the challenge, we propose a greedy algorithm and an epsilon-refining algorithm. Extensive experiments offer insight into the accuracy and efficiency of our proposed algorithms.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://dx.doi.org/10.24963/ijcai.2020/470 http://dx.doi.org/10.24963/ijcai.2020/470]<br />
<br />
* [https://www.ijcai.org/proceedings/2020/0470.pdf https://www.ijcai.org/proceedings/2020/0470.pdf]<br />
<br />
* [https://dblp.uni-trier.de/db/conf/ijcai/ijcai2020.html#LiCS20 https://dblp.uni-trier.de/db/conf/ijcai/ijcai2020.html#LiCS20],<br />
: [https://academic.microsoft.com/#/detail/3034378860 https://academic.microsoft.com/#/detail/3034378860]</div>Scipediacontent