A biobjective Dijkstra algorithm

DOI10.1016/j.ejor.2019.01.007zbMath1430.90517OpenAlexW2909085420WikidataQ128625507 ScholiaQ128625507MaRDI QIDQ1728479

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

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

Related Items (7)

An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ An improved multiobjective shortest path algorithm ⋮ A discrete optimisation approach for target path planning whilst evading sensors ⋮ Simple and efficient bi-objective search algorithms via fast dominance checks ⋮ Targeted multiobjective Dijkstra algorithm ⋮ An improved method of particle swarm optimization for path planning of mobile robot ⋮ Shortest paths with ordinal weights

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
• On a multicriteria shortest path problem
• A parametric approach to solving bicriterion shortest path problems
• A comparison of solution strategies for biobjective shortest path problems
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• Analysis of FPTASes for the multi-objective shortest path problem
• A label correcting approach for solving bicriterion shortest-path problems
• Speeding up Martins' algorithm for multiple objective shortest path problems
• An exact method for the biobjective shortest path problem for large-scale road networks
• Multiobjective A*
• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding the Shortest Route between Two Points in a Network
• Label correcting methods to solve multicriteria shortest path problems

This page was built for publication: A biobjective Dijkstra algorithm