Lagrangian relaxation for the multiple constrained robust shortest path problem
Summary: The study focuses on a multiple constrained reliable path problem in which travel time reliability and resource constraints are collectively considered. Nonlinear optimization model is developed to model constrained robust shortest path problem. The dual nature of the proposed problem is deduced based on the Lagrangian duality theory. An efficient algorithm based on Lagrangian dual relaxation is designed to solve constrained robust shortest path problem. An extension problem that considers multiple constraints is discussed. Numerical studies indicate that the proposed algorithm is efficient in terms of obtaining the close-to-optimal solutions within reasonable computational times.
- The constrained shortest path problem with stochastic correlated link travel times
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- Constrained shortest path problem in stochastic traffic network based on reliability
- scientific article; zbMATH DE number 3961370
- The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
- A dual algorithm for the constrained shortest path problem
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
- A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
- A penalty function heuristic for the resource constrained shortest path problem
- A survey of resource constrained shortest path problems: exact solution approaches
- A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
- An algorithm for the resource constrained shortest path problem
- Finding reliable shortest paths in road networks under uncertainty
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- Least expected time paths in stochastic, time-varying transportation networks
- Models and algorithm for stochastic shortest path problem
- On an exact method for the constrained shortest path problem
- Reliability based assignment in stochastic-flow freight network
- Shortest chain subject to side constraints
- Shortest path algorithms: An evaluation using real road networks
- Shortest Path Problems with Resource Constraints
- Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
- The constrained shortest path problem with stochastic correlated link travel times
- The shortest route problem with constraints
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- Corrigendum to: ``Lagrangian relaxation for the multiple constrained robust shortest path problem
- Finding reliable shortest paths in road networks under uncertainty
- Robust shortest path planning and semicontractive dynamic programming
- Constrained shortest path problem in stochastic traffic network based on reliability
- The constrained shortest path problem with stochastic correlated link travel times
- AI 2005: Advances in Artificial Intelligence
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
This page was built for publication: Lagrangian relaxation for the multiple constrained robust shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298370)
