Abstract
Train platforming is critical for ensuring the safety and efficiency of train operations within the stations, especially when unexpected train delays occur. This paper studies the problem of reoptimization of train platforming in case of train delays, where the train station is modeled using the discretization of the platform track time-space resources. To solve the reoptimization problem, we propose a mixed integer linear programming (MILP) model, which minimizes the weighted sum of total train delays and the platform track assignment costs, subject to constraints defined by operational requirements. Moreover, we design an efficient heuristic algorithm to solve the MILP model such that it can speed up the reoptimization process with good solution precision. Furthermore, a real-world case is taken as an example to show the efficiency and effectiveness of the proposed model and algorithm. The computational results show that the MILP model established in this paper can describe the reoptimization of train platforming accurately, and it can be solved quickly by the proposed heuristic algorithm. In addition, the model and algorithm developed in this paper can provide an effective computer-aided decision-making tool for the train dispatchers in case of train delays.
Highlights
Railroad transportation plays an important role in providing economic and environment-friendly transport services for passengers and goods
E complexity of the train platforming problem grows quickly as the number of trains increases and the station layout becomes more and more complicated. erefore, a lot of excellent works have been done regarding the train platforming problem, such as Carey [19], Zwaneveld et al [10], Lusby et al [12], Chakroborty and Vikram [20], Caprara et al [21], and Kang et al [22]. We review these works mainly from two aspects, i.e., the train platforming problem at the tactical level and the train platforming problem considering the negative impact of train delays
Exact algorithms account for the majority of the solution methods to solve the optimization or reoptimization of the train platforming problems. erefore, efficient and flexible heuristic algorithms are required, especially for the real-time reoptimization of the train platforming problem. ird, among the studies that consider the negative influence of train delays, only one research by Chakroborty and Vikram [20] simultaneously incorporates the factors of train delay, reassignment of platform, and deviations from scheduled train arrival and departure times
Summary
Railroad transportation plays an important role in providing economic and environment-friendly transport services for passengers and goods. The scheduled train timetable needs to be rescheduled in real time, and the train operations within the stations need to be reoptimized quickly to prevent any potential conflicts [15,16,17,18]. We reoptimize the train platforming problem in case of train delays and generate a new train operation plan within the station in real time. Our solution is to develop a mixed integer linear programming (MILP) model, where the train station is modeled using the discretized platform track time-space resources, and to propose an efficient heuristic algorithm. (3) An efficient heuristic algorithm is designed to quickly obtain the near-optimal solutions for the real-time reoptimization of train platforming.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
