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

DOI10.1016/J.COR.2014.11.010MaRDI QIDQ337491zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A biobjective Dijkstra algorithm
• Efficient solution generation for the bicriterion shortest path problems
• Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
• An exact method for the biobjective shortest path problem for large-scale road networks
• The shortest path problem with two objective functions

Cites work

• scientific article; zbMATH DE number 4091200 (Why is no real title available?)
• scientific article; zbMATH DE number 3726107 (Why is no real title available?)
• A comparison of solution strategies for biobjective shortest path problems
• A note on two problems in connexion with graphs
• A parametric approach to solving bicriterion shortest path problems
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• Fibonacci heaps and their uses in improved network optimization algorithms
• Introduction to algorithms.
• Label correcting methods to solve multicriteria shortest path problems
• Near-shortest and K-shortest simple paths
• Network flows. Theory, algorithms, and applications.
• On a multicriteria shortest path problem
• Shortest paths algorithms: Theory and experimental evaluation
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• The shortest path problem with two objective functions

Cited in

(14)

• An exact method for the biobjective shortest path problem for large-scale road networks
• A biobjective Dijkstra algorithm
• Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions
• Uncertain multi-objective multi-route shortest path problem by robust enhanced non-dominated sorting genetic algorithms: application to emergency medical services
• Ant Lion Optimized Lexicographic Model for Shortest Path Identification
• Efficient solution generation for the bicriterion shortest path problems
• 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
• Uncertain programming models for multi-objective shortest path problem with uncertain parameters
• Simple and efficient bi-objective search algorithms via fast dominance checks
• Eco-routing problem for the delivery of perishable products
• Enhanced non-dominated sorting genetic algorithms for uncertain multi-objective shortest path problem: application to fire prevention services

Describes a project that uses

Uses Software

• DIMACS

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

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