Lagrangian relaxation for the multiple constrained robust shortest path problem

DOI10.1155/2019/3987278MaRDI QIDQ2298370zbMATH OpenOpenAlexFDO

Authors Yiyong Pan

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/3987278

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• 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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• 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 dual algorithm for the constrained shortest path problem
• 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
• 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 Path Problems with Resource Constraints
• Shortest chain subject to side constraints
• Shortest path algorithms: An evaluation using real road networks
• 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

Cited in

(7)

• Robust shortest path planning and semicontractive dynamic programming
• Constrained shortest path problem in stochastic traffic network based on reliability
• AI 2005: Advances in Artificial Intelligence
• Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
• Corrigendum to: ``Lagrangian relaxation for the multiple constrained robust shortest path problem
• The constrained shortest path problem with stochastic correlated link travel times
• Finding reliable shortest paths in road networks under uncertainty

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)