An FPTAS for Dynamic Multiobjective Shortest Path Problems

An FPTAS for Dynamic Multiobjective Shortest Path Problems

The Dynamic Multiobjective Shortest Path problem features multidimensional costs that can depend on several variables and not only on time; this setting is motivated by flight planning applications and the routing of electric vehicles. We give an exact algorithm for the FIFO case and derive from it...

Full description

Bibliographic Details
Main Authors: Pedro Maristany de las Casas, Ralf Borndörfer, Luitgard Kraus, Antonio Sedeño-Noda
Format: Article
Language:English
Published: MDPI AG 2021-01-01
Series:Algorithms
Subjects:
multiobjective shortest paths
time dependent shortest paths
multiobjective approximation algorithms
flight planning problem
Online Access:https://www.mdpi.com/1999-4893/14/2/43
id doaj-4c8e1691a6ad40a5a49ac37a0d486a6e
record_format Article
spelling doaj-4c8e1691a6ad40a5a49ac37a0d486a6e2021-01-30T00:03:11ZengMDPI AGAlgorithms1999-48932021-01-0114434310.3390/a14020043An FPTAS for Dynamic Multiobjective Shortest Path ProblemsPedro Maristany de las Casas0Ralf Borndörfer1Luitgard Kraus2Antonio Sedeño-Noda3Network Optimization Department, Zuse Institute Berlin, Takustraße 7, 14195 Berlin, GermanyNetwork Optimization Department, Zuse Institute Berlin, Takustraße 7, 14195 Berlin, GermanyNetwork Optimization Department, Zuse Institute Berlin, Takustraße 7, 14195 Berlin, GermanyDepartamento de Matemáticas, Estadística e Investigación Operativa, Universidad de La Laguna, 38271 San Cristóbal de La Laguna, Santa Cruz de Tenerife, SpainThe Dynamic Multiobjective Shortest Path problem features multidimensional costs that can depend on several variables and not only on time; this setting is motivated by flight planning applications and the routing of electric vehicles. We give an exact algorithm for the FIFO case and derive from it an FPTAS for both, the static Multiobjective Shortest Path (MOSP) problems and, under mild assumptions, for the dynamic problem variant. The resulting FPTAS is computationally efficient and beats the known complexity bounds of other FPTAS for MOSP problems.https://www.mdpi.com/1999-4893/14/2/43multiobjective shortest pathstime dependent shortest pathsmultiobjective approximation algorithmsflight planning problem
collection DOAJ
language English
format Article
sources DOAJ
author Pedro Maristany de las Casas
Ralf Borndörfer
Luitgard Kraus
Antonio Sedeño-Noda
spellingShingle Pedro Maristany de las Casas
Ralf Borndörfer
Luitgard Kraus
Antonio Sedeño-Noda
An FPTAS for Dynamic Multiobjective Shortest Path Problems
Algorithms
multiobjective shortest paths
time dependent shortest paths
multiobjective approximation algorithms
flight planning problem
author_facet Pedro Maristany de las Casas
Ralf Borndörfer
Luitgard Kraus
Antonio Sedeño-Noda
author_sort Pedro Maristany de las Casas
title An FPTAS for Dynamic Multiobjective Shortest Path Problems
title_short An FPTAS for Dynamic Multiobjective Shortest Path Problems
title_full An FPTAS for Dynamic Multiobjective Shortest Path Problems
title_fullStr An FPTAS for Dynamic Multiobjective Shortest Path Problems
title_full_unstemmed An FPTAS for Dynamic Multiobjective Shortest Path Problems
title_sort fptas for dynamic multiobjective shortest path problems
publisher MDPI AG
series Algorithms
issn 1999-4893
publishDate 2021-01-01
description The Dynamic Multiobjective Shortest Path problem features multidimensional costs that can depend on several variables and not only on time; this setting is motivated by flight planning applications and the routing of electric vehicles. We give an exact algorithm for the FIFO case and derive from it an FPTAS for both, the static Multiobjective Shortest Path (MOSP) problems and, under mild assumptions, for the dynamic problem variant. The resulting FPTAS is computationally efficient and beats the known complexity bounds of other FPTAS for MOSP problems.
topic multiobjective shortest paths
time dependent shortest paths
multiobjective approximation algorithms
flight planning problem
url https://www.mdpi.com/1999-4893/14/2/43
work_keys_str_mv AT pedromaristanydelascasas anfptasfordynamicmultiobjectiveshortestpathproblems
AT ralfborndorfer anfptasfordynamicmultiobjectiveshortestpathproblems
AT luitgardkraus anfptasfordynamicmultiobjectiveshortestpathproblems
AT antoniosedenonoda anfptasfordynamicmultiobjectiveshortestpathproblems
AT pedromaristanydelascasas fptasfordynamicmultiobjectiveshortestpathproblems
AT ralfborndorfer fptasfordynamicmultiobjectiveshortestpathproblems
AT luitgardkraus fptasfordynamicmultiobjectiveshortestpathproblems
AT antoniosedenonoda fptasfordynamicmultiobjectiveshortestpathproblems
_version_ 1724318488988745728

Similar Items