Label correcting methods to solve multicriteria shortest path problems
From MaRDI portal
Publication:5956971
DOI10.1023/A:1012602011914zbMATH Open0984.90050OpenAlexW1527511816WikidataQ58921786 ScholiaQ58921786MaRDI QIDQ5956971FDOQ5956971
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
Recommendations
- On a multicriteria shortest path problem
- A label correcting approach for solving bicriterion shortest-path problems
- The interactive analysis of the multicriteria shortest path problem by the reference point method.
- Solving min-max shortest-path problems on a network
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
Pareto optimal solutionsmulticriteria shortest path problemmulticriteria networklabel correcting methodslabeling methodsPareto-optimal path-length vectors
Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Title not available (Why is that?)
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- An empirical investigation of some bicriterion shortest path algorithms
- A label correcting approach for solving bicriterion shortest-path problems
- Generalized dynamic programming for multicriteria optimization
- A bicriterion shortest path algorithm
- Multiobjective programming and planning
- A multicriteria Pareto-optimal path algorithm
- On a multicriteria shortest path problem
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- 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 procedure using domination cones for bicriterion shortest path problems
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
- Parallel asynchronous label-correcting methods for shortest paths
Cited In (35)
- An exact method for the biobjective shortest path problem for large-scale road networks
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- A biobjective Dijkstra algorithm
- A simple and fast label correcting algorithm for shortest paths
- Least expected time paths in stochastic schedule-based transit networks
- Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- Finding all nondominated points of multi-objective integer programs
- Title not available (Why is that?)
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- A robust optimization approach with probe-able uncertainty
- On a multicriteria shortest path problem
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- A new approach for the multiobjective minimum spanning tree
- A comparison of solution strategies for biobjective shortest path problems
- The determination of the path with minimum-cost norm value
- An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Bi-objective robust optimisation
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
- The tricriterion shortest path problem with at least two bottleneck objective functions
- 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 personalized urban multicriteria shortest path stochastic optimization algorithm
- Dimensionality reduction in multiobjective shortest path search
- Minimum cost path problems with relays
- An aggregate label setting policy for the multi-objective shortest path problem
- Solving multi-objective traffic assignment
- Common Route Planning for Carpoolers – Model and Exact Algorithm
- Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
- The Steiner bi-objective shortest path problem
- Speeding up Martins' algorithm for multiple objective shortest path problems
- Solving min-max shortest-path problems on a network
Uses Software
This page was built for publication: Label correcting methods to solve multicriteria shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956971)
