Label correcting methods to solve multicriteria shortest path problems

DOI10.1023/A:1012602011914zbMath0984.90050OpenAlexW1527511816WikidataQ58921786 ScholiaQ58921786MaRDI QIDQ5956971

Francesca Guerriero, Roberto Musmanno

Publication date: 26 February 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012602011914

zbMATH Keywords

Pareto optimal solutionslabel correcting methodslabeling methodsmulticriteria networkmulticriteria shortest path problemPareto-optimal path-length vectors

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ Bi-objective robust optimisation ⋮ A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem ⋮ Path based algorithms for metro network design ⋮ A new approach for the multiobjective minimum spanning tree ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ A personalized urban multicriteria shortest path stochastic optimization algorithm ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Finding all nondominated points of multi-objective integer programs ⋮ An aggregate label setting policy for the multi-objective shortest path problem ⋮ Common Route Planning for Carpoolers – Model and Exact Algorithm ⋮ Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations ⋮ The Steiner bi-objective shortest path problem ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem ⋮ An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem ⋮ A biobjective Dijkstra algorithm ⋮ Solving multi-objective traffic assignment ⋮ A robust optimization approach with probe-able uncertainty ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ On algorithms for the tricriteria shortest path problem with two bottleneck objective functions ⋮ Minimum cost path problems with relays ⋮ The determination of the path with minimum-cost norm value ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ Least expected time paths in stochastic schedule-based transit networks ⋮ Dynamic programming and suboptimal control: a survey from ADP to MPC ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• On a multicriteria shortest path problem
• A parametric approach to solving bicriterion shortest path problems
• Generalized dynamic programming for multicriteria optimization
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Multiobjective programming and planning
• A bicriterion shortest path algorithm
• A multicriteria Pareto-optimal path algorithm
• An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
• An interactive procedure using domination cones for bicriterion shortest path problems
• A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
• An empirical investigation of some bicriterion shortest path algorithms
• Parallel asynchronous label-correcting methods for shortest paths
• A label correcting approach for solving bicriterion shortest-path problems
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems