Robust Train Scheduling Problem with Optimized Maintenance Planning on High-Speed Railway Corridors: The China Case
Simultaneously considering train scheduling problem and maintenance planning problem with uncertain travel time, we propose a two-stage integrated optimization model for the sunset-departure and sunrise-arrival trains (SDSA-trains). Specifically, in the first stage, we obtain an optimal solution of...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2018-01-01
|
Series: | Journal of Advanced Transportation |
Online Access: | http://dx.doi.org/10.1155/2018/6157192 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Simultaneously considering train scheduling problem and maintenance planning problem with uncertain travel time, we propose a two-stage integrated optimization model for the sunset-departure and sunrise-arrival trains (SDSA-trains). Specifically, in the first stage, we obtain an optimal solution of the SDSA-trains under each scenario, which leads to the minimum total travel time. In the second stage, a robust SDSA-train schedule is generated based on the optimal solutions of the first stage. The key is that we consider two operation modes to solve the conflict between the SDSA-trains and the maintenances. Some state variables are used to deal with train operation mode selection. Furthermore, some linearization techniques are used to formulate a mixed-integer linear programming (MILP) model. Finally, numerical experiments are implemented to prove the effectiveness of the proposed model and optimization method. |
---|---|
ISSN: | 0197-6729 2042-3195 |