A label correcting approach for solving bicriterion shortest-path problems
From MaRDI portal
Publication:1977617
DOI10.1016/S0305-0548(99)00037-4zbMath0955.90144OpenAlexW2099466544WikidataQ127350206 ScholiaQ127350206MaRDI QIDQ1977617
Anders J. V. Skriver, Kim Allan Andersen
Publication date: 4 March 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00037-4
Related Items (43)
Finding reliable shortest paths in road networks under uncertainty ⋮ Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives ⋮ Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ A biobjective optimization model for routing in mobile ad hoc networks ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ On the cardinality of the Pareto set in bicriteria shortest path problems ⋮ Generic constraints handling techniques in constrained multi-criteria optimization and its application ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ Path based algorithms for metro network design ⋮ A simulated annealing for multi-criteria network path problems ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ 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 ⋮ Multi-objective and multi-constrained non-additive shortest path problems ⋮ An improved multiobjective shortest path algorithm ⋮ The smoothed number of Pareto-optimal solutions in bicriteria integer optimization ⋮ Targeted multiobjective Dijkstra algorithm ⋮ Generalized nash fairness solutions for bi‐objective minimization problems ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem ⋮ The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ A biobjective Dijkstra algorithm ⋮ Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem ⋮ A survey of recent developments in multiobjective optimization ⋮ Extended dominance and a stochastic shortest path problem ⋮ Non-additive shortest path in the context of traffic assignment ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Improved smoothed analysis of multiobjective optimization ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ The quickest path problem with interval lead times ⋮ 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 ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ Design of supply chain networks with multi-phased discount price and service level: formulation, complexity, and algorithm ⋮ The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
Cites Work
- A parametric approach to solving bicriterion shortest path problems
- A bicriterion shortest path algorithm
- On bicriterion minimal spanning trees: An approximation
- An empirical investigation of some bicriterion shortest path algorithms
- Modeling of Transport Risk for Hazardous Materials
- Unnamed Item
- Unnamed Item
This page was built for publication: A label correcting approach for solving bicriterion shortest-path problems
