An empirical investigation of some bicriterion shortest path algorithms
From MaRDI portal
Publication:1823874
DOI10.1016/0377-2217(89)90215-4zbMath0681.90081OpenAlexW2068113337MaRDI QIDQ1823874
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90215-4
Related Items (37)
Finding reliable shortest paths in road networks under uncertainty ⋮ Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ 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 ⋮ Path based algorithms for metro network design ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Multiobjective routing problems ⋮ Multi-objective and multi-constrained non-additive shortest path problems ⋮ The Steiner bi-objective shortest 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 ⋮ 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 ⋮ The gateway location problem: assessing the impact of candidate site selection policies ⋮ A label correcting approach for solving bicriterion shortest-path problems ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ A survey of recent developments in multiobjective optimization ⋮ 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 ⋮ The shortest path problem with discrete fuzzy arc lengths ⋮ The fuzzy shortest path length and the corresponding shortest path in a network ⋮ The quickest path problem with interval lead times ⋮ A new algorithm for the discrete fuzzy shortest path problem in a network ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ On algorithms for the tricriteria shortest path problem with two bottleneck objective functions ⋮ Unnamed Item ⋮ 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 ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite ⋮ The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a multicriteria shortest path problem
- The shortest path problem with two objective functions
- A bicriterion shortest path algorithm
- Optimal paths in graphs with stochastic or multidimensional weights
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- On a routing problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Implementation and efficiency of Moore-algorithms for the shortest route problem
This page was built for publication: An empirical investigation of some bicriterion shortest path algorithms
