License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2020.11
URN: urn:nbn:de:0030-drops-131476
URL: https://drops.dagstuhl.de/opus/volltexte/2020/13147/
Go to the corresponding OASIcs Volume Portal


Hanusse, Nicolas ; Ilcinkas, David ; Lentz, Antonin

Framing Algorithms for Approximate Multicriteria Shortest Paths

pdf-format:
OASIcs-ATMOS-2020-11.pdf (0.8 MB)


Abstract

This paper deals with the computation of d-dimensional multicriteria shortest paths. In a weighted graph with arc weights represented by vectors, the cost of a path is the vector sum of the weights of its arcs. For a given pair consisting of a source s and a destination t, a path P dominates a path Q if and only if P’s cost is component-wise smaller than or equal to Q’s cost. The set of Pareto paths, or Pareto set, from s to t is the set of paths that are not dominated. The computation time of the Pareto paths can be prohibitive whenever the set of Pareto paths is large. We propose in this article new algorithms to compute approximated Pareto paths in any dimension. For d = 2, we exhibit the first approximation algorithm, called Frame, whose output is guaranteed to be always a subset of the Pareto set. Finally, we provide a small experimental study in order to confirm the relevance of our Frame algorithm.

BibTeX - Entry

@InProceedings{hanusse_et_al:OASIcs:2020:13147,
  author =	{Nicolas Hanusse and David Ilcinkas and Antonin Lentz},
  title =	{{Framing Algorithms for Approximate Multicriteria Shortest Paths}},
  booktitle =	{20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)},
  pages =	{11:1--11:19},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-170-2},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{85},
  editor =	{Dennis Huisman and Christos D. Zaroliagis},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13147},
  URN =		{urn:nbn:de:0030-drops-131476},
  doi =		{10.4230/OASIcs.ATMOS.2020.11},
  annote =	{Keywords: Pareto set, multicriteria, shortest paths, approximation}
}

Keywords: Pareto set, multicriteria, shortest paths, approximation
Collection: 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
Issue Date: 2020
Date of publication: 10.11.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI