A parametric approach to solving bicriterion shortest path problems
From MaRDI portal
Publication:810382
DOI10.1016/0377-2217(91)90094-CzbMath0733.90073MaRDI QIDQ810382
Ishwar Murthy, John Mote, David L. Olson
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
LP relaxationparametric approachPareto-optimal pathsbicriterion network problembicriterion shortest pathlabel correcting procedure
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (31)
Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ On the cardinality of the Pareto set in bicriteria shortest path problems ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem ⋮ Analysis of FPTASes for the multi-objective shortest path problem ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Multiobjective routing problems ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ The Steiner bi-objective shortest path problem ⋮ On the sum-max bicriterion path problem. ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ A comparison of heuristic best-first algorithms for bicriterion shortest path problems ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ A biobjective Dijkstra algorithm ⋮ Solving multi-objective traffic assignment ⋮ A label correcting approach for solving bicriterion shortest-path problems ⋮ Extended dominance and a stochastic shortest path problem ⋮ Routing with nonlinear multiattribute cost functions ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ On algorithms for the tricriteria shortest path problem with two bottleneck objective functions ⋮ Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ The \(k\)-centrum shortest path problem ⋮ Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- The shortest path problem with two objective functions
- An algorithm for bicriterion linear programming
- A bicriterion shortest path algorithm
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- On a routing problem
- Shortest-path algorithms: Taxonomy and annotation
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Linear Multiparametric Programming by Multicriteria Simplex Method
- Solving Bicriterion Mathematical Programs
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: A parametric approach to solving bicriterion shortest path problems
