The constrained shortest path problem with stochastic correlated link travel times
详细信息 查看全文
- 作者：Li Wang ; Lixing Yang ; lxyang@bjtu.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Ziyou Gao
- 关键词：Constrained programming ; Constrained shortest path problem ; Stochastic correlated link travel times ; Lagrangian relaxation ; Label-correcting algorithm
- 刊名：European Journal of Operational Research
- 出版年：2016
- 出版时间：16 November 2016
- 年：2016
- 卷：255
- 期：1
- 页码：43-57
- 全文大小：1420 K
文摘
- •
We first propose the constrained shortest path problem with stochastic correlated link travel times.
- •
A 0–1 integer programming model for the proposed constrained shortest path problem is formulated.
- •
A specific Lagrangian relaxation-based approach is presented to relax the hard constraints.
- •
An algorithmic framework is designed to minimize the gap between the upper and lower bounds.
- •
The effectiveness of proposed approaches is verified by different scales of transportation networks.