Lagrangian relaxation for the multiple constrained robust shortest path problem

DOI10.1155/2019/3987278zbMATH Open1435.90140OpenAlexW2954619438MaRDI QIDQ2298370FDOQ2298370

Authors: Yiyong Pan 

Publication date: 20 February 2020

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

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Shortest Path Problems with Resource Constraints
• Finding reliable shortest paths in road networks under uncertainty
• Least expected time paths in stochastic, time-varying transportation networks
• A Mean-Variance Model for Route Guidance in Advanced Traveler Information Systems
• Shortest path algorithms: An evaluation using real road networks
• A survey of resource constrained shortest path problems: exact solution approaches
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
• A penalty function heuristic for the resource constrained shortest path problem
• The shortest route problem with constraints
• The constrained shortest path problem with stochastic correlated link travel times
• On an exact method for the constrained shortest path problem
• Shortest chain subject to side constraints
• An algorithm for the resource constrained shortest path problem
• Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
• A dual algorithm for the constrained shortest path problem
• Models and algorithm for stochastic shortest path problem
• Reliability based assignment in stochastic-flow freight network
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem

Cited In (7)

• Finding reliable shortest paths in road networks under uncertainty
• Robust shortest path planning and semicontractive dynamic programming
• AI 2005: Advances in Artificial Intelligence
• The constrained shortest path problem with stochastic correlated link travel times
• Constrained shortest path problem in stochastic traffic network based on reliability
• Corrigendum to: ``Lagrangian relaxation for the multiple constrained robust shortest path problem
• 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)