An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem

DOI10.1287/IJOC.2021.1081OpenAlexW3135536219MaRDI QIDQ5084630FDOQ5084630

Authors: Antoine Giret, E. Néron, G. Sauvanet, Y. Kergosien 

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2021.1081

Recommendations

• An improved multiobjective shortest path algorithm
• Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
• Label correcting methods to solve multicriteria shortest path problems
• A label correcting approach for solving bicriterion shortest-path problems
• A multi-objective shortest path problem

zbMATH Keywords

shortest pathmultiobjectivelabel-correctingcycling itineraries

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• A note on two problems in connexion with graphs
• On a routing problem
• Multicriteria Optimization
• Shortest Path Problems with Resource Constraints
• An empirical investigation of some bicriterion shortest path algorithms
• A label correcting approach for solving bicriterion shortest-path problems
• Proper efficiency and the theory of vector maximization
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• A bicriterion shortest path algorithm
• An algorithm for the ranking of shortest paths
• A multicriteria Pareto-optimal path algorithm
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
• Multiobjective \(\mathrm{A}^\ast\) search with consistent heuristics
• Bicriteria Transportation Problem
• Title not available (Why is that?)
• A bicriterion approach for routing problems in multimedia networks
• Multi‐objective combinatorial optimization problems: A survey
• On a multicriteria shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey on multi-constrained optimal path computation: exact and approximate algorithms
• An exact method for the biobjective shortest path problem for large-scale road networks
• Shortest-path algorithms: Taxonomy and annotation
• On an exact method for the constrained shortest path problem
• An algorithm for the resource constrained shortest path problem
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• Near-shortest and K-shortest simple paths
• Label correcting methods to solve multicriteria shortest path problems
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
• A parametric approach to solving bicriterion shortest path problems
• Acceleration strategies for the weight constrained shortest path problem with replenishment
• Search for the best compromise solution on multiobjective shortest path problem
• Speeding up Martins' algorithm for multiple objective shortest path problems
• Lower bound sets for biobjective shortest path problems
• An exact bidirectional pulse algorithm for the constrained shortest path
• Extensions of labeling algorithms for multi-objective uncertain shortest path problems
• A biobjective Dijkstra algorithm
• Algorithms for non-linear and stochastic resource constrained shortest path
• Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\)
• An exact bidirectional \(A^\star\) approach for solving resource-constrained shortest path problems
• The fixed-charge shortest-path problem

Cited In (4)

• A simple and fast label correcting algorithm for shortest paths
• Title not available (Why is that?)
• Ordinal optimization through multi-objective reformulation
• The Steiner bi-objective shortest path problem

Uses Software

• CPU Benchmarks

This page was built for publication: An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem

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