Space and time trade-off for the k shortest simple paths problem

Ali Al Zoobi 1 David Coudert 1 Nicolas Nisse 1
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : The k shortest simple path problem (KSSP) asks to compute a set of top-k shortest simple paths from a vertex s to a vertex t in a digraph. Yen (1971) proposed the first algorithm with the best known theoretical complexity of O(kn(m + n log n)) for a digraph with n vertices and m arcs. Since then, the problem has been widely studied from an algorithm engineering perspective, and impressive improvements have been achieved. In particular, Kurz and Mutzel (2016) proposed a sidetracks-based (SB) algorithm which is currently the fastest solution. In this work, we propose two improvements of this algorithm. We first show how to speed up the SB algorithm using dynamic updates of shortest path trees. We did experiments on some road networks of the 9th DIMAC'S challenge with up to about half a million nodes and one million arcs. Our computational results show an average speed up by a factor of 1.5 to 2 with a similar working memory consumption as SB. We then propose a second algorithm enabling to significantly reduce the working memory at the cost of an increase of the running time (up to two times slower). Our experiments on the same data set show, on average, a reduction by a factor of 1.5 to 2 of the working memory.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02465317
Contributor : Ali Al Zoobi <>
Submitted on : Monday, February 3, 2020 - 6:00:15 PM
Last modification on : Wednesday, February 5, 2020 - 1:33:06 AM

File

HAL_kSSP.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02465317, version 1

Citation

Ali Al Zoobi, David Coudert, Nicolas Nisse. Space and time trade-off for the k shortest simple paths problem. [Research Report] Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France. 2020. ⟨hal-02465317⟩

Share

Metrics

Record views

50

Files downloads

36