Targeted Multiobjective Dijkstra Algorithm

by   Pedro Maristany de las Casas, et al.
Universidad de La Laguna
Zuse Institute Berlin

In this paper, we introduce the Targeted Multiobjective Dijkstra Algorithm (T-MDA), a label setting algorithm for the One-to-One Multiobjective Shortest Path (MOSP) Problem. The T-MDA is based on the recently published Multiobjective Dijkstra Algorithm (MDA) and equips it with A*-like techniques. The resulting speedup is comparable to the speedup that the original A* algorithm achieves for Dijkstra's algorithm. Unlike other methods from the literature, which rely on special properties of the biobjective case, the T-MDA works for any dimension. To the best of our knowledge, it gives rise to the first efficient implementation that can deal with large scale instances with more than two objectives. A version tuned for the biobjective case, the T-BDA, outperforms state-of-the-art methods on almost every instance of a standard benchmark testbed that is not solvable in fractions of a second.


page 1

page 2

page 3

page 4


K-Shortest Simple Paths Using Biobjective Path Search

In this paper we introduce a new algorithm for the k-Shortest Simple Pat...

Shortest Path Algorithms between Theory and Practice

Utilizing graph algorithms is a common activity in computer science. Alg...

Accelerating Concurrent Heap on GPUs

Priority queue, often implemented as a heap, is an abstract data type th...

Fast One-to-Many Multicriteria Shortest Path Search

This paper introduces a novel algorithm combination designed for fast on...

Decomposition Based Refinement for the Network Interdiction Problem

The shortest path network interdiction (SPNI) problem poses significant ...

Solve For Shortest Paths Problem Within Logarithm Runtime

The Shortest Paths Problem (SPP) is no longer unresolved. Just for a lar...

Please sign up or login with your details

Forgot password? Click here to reset