Multiple Objective Path Optimization for Time Dependent Objective Functions

Kostreva, Michael M.; Lancaster, Laura C.

doi:10.1007/978-3-7908-1812-3_10

Cited by 3 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The literature considering MOSP instances with dynamic, also called time-dependent, cost functions is scarce. Kostreva and Lancaster [19] presented an algorithm for nonmonotone increasing arc cost functions that does not reduce to Dynamic Programming. Disser et al [20] mention the necessity to tackle this kind of problems on train networks and use Martins's algorithm to solve them without going into details.…”

Section: Literature Reviewmentioning

confidence: 99%

An FPTAS for Dynamic Multiobjective Shortest Path Problems

2021

View full text Add to dashboard Cite

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.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

An FPTAS for Dynamic Multiobjective Shortest Path Problems

2021

View full text Add to dashboard Cite

show abstract

“…Multiobjective shortest path problems were considered by Henig (1985a), Warburton (1987), and Getachew (1992). Time dependency in multiobjective dynamic programming was presented by Kostreva and Wiecek (1993) and Kostreva and Lancaster (2002).…”

Section: Introductionmentioning

confidence: 99%