Fast One-to-Many Multicriteria Shortest Path Search
Abstract
This paper introduces a novel algorithm combination designed for fast one-to-many multicriteria shortest path search. A preprocessing algorithm excludes irrelevant vertices by building a smaller cover graph. A modified version of multicriteria label-setting algorithm operates on the cover graph and employs a dimensionality reduction technique for swifter domination checks. While the method itself maintains solution optimality, it is able to additionally incorporate existing heuristics for further speedups. The proposed algorithm has been tested on multiple criteria combinations of varying correlation. The results show the introduced approach provides a speedup of at least 6 times on simple criteria combinations and up to 60 times on hard instances compared to vanilla multicriteria label-setting. Graph preprocessing also decreases memory requirements of queries by up to 13 times.
Keywords
Cite
@article{arxiv.2201.12684,
title = {Fast One-to-Many Multicriteria Shortest Path Search},
author = {Temirlan Kurbanov and Marek Cuchý and Jiří Vokřínek},
journal= {arXiv preprint arXiv:2201.12684},
year = {2022}
}
Comments
11 pages, 2 figures