Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations

详细信息    查看全文

• 作者：Lixing Yang^a ; ^{lxyang@bjtu.edu.cn} ; Xuesong Zhou^b ; ^{zhou74@asu.edu}
• 关键词：Reliable path finding ; On-time arrival path ; Percentile path ; Lagrangian relaxation
• 刊名：Transportation Research Part B: Methodological
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：96
• 期：Complete
• 页码：68-91
• 全文大小：1721 K
• 卷排序：96

文摘

Sample-based time-variant link travel times are adopted to capture the correlations of dynamics and randomness in transportation networks. We transform two-stage non-linear stochastic programming models into their linear forms for finding the most reliable paths with two reliability evaluation criteria. A Lagrangian relaxation based algorithmic framework is provided to solve different models. Numerical experiments demonstrate the efficiency and effectiveness of the proposed approaches.