A biobjective Dijkstra algorithm

DOI10.1016/J.EJOR.2019.01.007MaRDI QIDQ1728479zbMATH OpenOpenAlexWikidataFDO

Authors Marcos Colebrook, Antonio Sedeño-Noda

Publication date 25 February 2019

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2019.01.007

zbMATH Keywords

network optimizationDijkstra's algorithmbiobjective path problemsefficient paths

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• A comparison of solution strategies for biobjective shortest path problems
• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
• Shortest paths with shortest detours. A biobjective routing problem
• Targeted multiobjective Dijkstra algorithm
• An exact method for the biobjective shortest path problem for large-scale road networks
• scientific article; zbMATH DE number 4179156
• The problem of the optimal biobjective spanning tree
• A parallel bio-inspired shortest path algorithm
• Heuristics for the bi-objective path dissimilarity problem
• Algorithms for biobjective shortest path problems in fuzzy networks

Cites work

• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 3726107 (Why is no real title available?)
• scientific article; zbMATH DE number 3415384 (Why is no real title available?)
• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• A label correcting approach for solving bicriterion shortest-path problems
• A note on two problems in connexion with graphs
• A parametric approach to solving bicriterion shortest path problems
• An exact method for the biobjective shortest path problem for large-scale road networks
• Analysis of FPTASes for the multi-objective shortest path problem
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding the Shortest Route between Two Points in a Network
• Introduction to algorithms.
• Label correcting methods to solve multicriteria shortest path problems
• Multiobjective A*
• Network flows. Theory, algorithms, and applications.
• On a multicriteria shortest path problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Speeding up Martins' algorithm for multiple objective shortest path problems

Cited in

(11)

• An exact method for the biobjective shortest path problem for large-scale road networks
• Enhanced methods for the weight constrained shortest path problem
• Shortest paths with ordinal weights
• A comparison of solution strategies for biobjective shortest path problems
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
• A discrete optimisation approach for target path planning whilst evading sensors
• An improved method of particle swarm optimization for path planning of mobile robot
• Simple and efficient bi-objective search algorithms via fast dominance checks
• Targeted multiobjective Dijkstra algorithm
• An improved multiobjective shortest path algorithm

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: A biobjective Dijkstra algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1728479)