A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem

DOI10.1016/J.COR.2014.11.010zbMath1348.90607OpenAlexW2066426639MaRDI QIDQ337491

Antonio Sedeño-Noda, Andrea Raith

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.11.010

zbMATH Keywords

biobjective path problemslabel-setting algorithmsupported efficient paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Uncertain programming models for multi-objective shortest path problem with uncertain parameters ⋮ Analysis of FPTASes for the multi-objective shortest path problem ⋮ Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ A discrete optimisation approach for target path planning whilst evading sensors ⋮ Simple and efficient bi-objective search algorithms via fast dominance checks ⋮ Eco-routing problem for the delivery of perishable products ⋮ A biobjective Dijkstra algorithm ⋮ Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions ⋮ Ant Lion Optimized Lexicographic Model for Shortest Path Identification

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On a multicriteria shortest path problem
• A parametric approach to solving bicriterion shortest path problems
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• A comparison of solution strategies for biobjective shortest path problems
• The shortest path problem with two objective functions
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• Shortest paths algorithms: Theory and experimental evaluation
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• Near-shortest and K-shortest simple paths
• Label correcting methods to solve multicriteria shortest path problems

This page was built for publication: A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem