Search for the best compromise solution on multiobjective shortest path problem

DOI10.1016/J.ENDM.2010.05.078MaRDI QIDQ2883625zbMATH OpenOpenAlexFDO

Authors G. Sauvanet, E. Néron

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.078

zbMATH Keywords

best compromise A*multiobjective shortest path problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Recommendations

• An interactive approach to identify the best compromise solution for two objective shortest path problems
• A multi-objective shortest path problem
• On a multicriteria shortest path problem
• New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
• Multiobjective routing problems

Cites work

• A note on two problems in connexion with graphs
• Computing the shortest path: A^ search meets graph theory
• Multiobjective A*
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms

Cited in

(5)

• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
• Ordinal optimization through multi-objective reformulation
• Multi-objective and multi-constrained non-additive shortest path problems
• Bicycle improvement design problem using real bike trajectories
• An interactive approach to identify the best compromise solution for two objective shortest path problems

This page was built for publication: Search for the best compromise solution on multiobjective shortest path problem

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