.png){kind=icon}
返回
A novel mixed integer programming model for freight train travel time estimation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2021.08.030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Travel time estimation is a crucial problem in the field of transportation. While this problem has been extensively studied for over-the-road and air travel modes of transportation and researchers have accomplished substantial advancements in improving the accuracy of the related models, we still observe a significant lack of accurate methods for estimating the travel time of freight trains. The planned train schedule is often dramatically affected by the delays that occur in complex networks due to various reasons such as train movement conflicts, resource unavailability, and unforeseen conditions. We develop a novel mixed integer programming model to address this problem. Considering the current train schedule, characteristics of the railroads, availability of resources, operational restrictions, different types of delay, and congestion-related factors, the proposed model obtains the estimated travel time of trains by minimizing the total amount of deviation from the planned timetable. This optimization scheme enables us to impose all business constraints and network restrictions on the model. Our proposed formulation is generic and can be utilized for other railway networks with minor modifications. To evaluate our model, we use the network characteristics and planned trains movement data of Prorail in Netherlands. The model is implemented in Julia and solved with Gurobi solver efficiently which demonstrates the superiority of our approach. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Integer programming
Freight trains
Travel time
Estimation
Delay
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Gear Shape Parameter Measurement Using a Model-Based Scanning Multi-Distance Measurement Approach.png)
Sensors
OAAI
SensorsIF0
OAAI分享收藏
分享收藏Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds具有最佳保证的单轨火车时间表: 具有增强下限的分支定界算法
PREAI
分享收藏
查看更多内容