TY - GEN
A1 - Maristany de las Casas, Pedro
A1 - Sedeno-Noda, Antonio
A1 - BorndÃ¶rfer, Ralf
T1 - An Improved Multiobjective Shortest Path Algorithm
N2 - We present a new label-setting algorithm for the Multiobjective Shortest Path (MOSP) problem that computes the minimal complete set of efficient paths for a given instance. The size of the priority queue used in the algorithm is bounded by the number of nodes in the input graph and extracted labels are guaranteed to be efficient. These properties allow us to give a tight output-sensitive running time bound for the new algorithm that can almost be expressed in terms of the running time of Dijkstra's algorithm for the Shortest Path problem. Hence, we suggest to call the algorithm \emph{Multiobjective Dijkstra Algorithm} (MDA). The simplified label management in the MDA allows us to parallelize some subroutines. In our computational experiments, we compare the MDA and the classical label-setting MOSP algorithm by Martins', which we improved using new data structures and pruning techniques. On average, the MDA is $\times2$ to $\times9$ times faster on all used graph types. On some instances the speedup reaches an order of magnitude.
T3 - ZIB-Report - 20-26
KW - Multiobjective Shortest Path Problem
KW - Output-Sensitive Multiobjective Combinatorial Problems
KW - Network Optimization
Y1 - 2021
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/7971
UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-79712
SN - 1438-0064
ER -