Conference article

Train platforming is critical for ensuring safety and efficiency of train operations within the stations, especially when train delays occur. This paper studies the problem of re-optimization of train platforming, where the train station is modeled using discretization of the platform track time-space resources. To solve the re-optimization problem, we propose a binary integer programming model which minimizes the weighted sum of total train delays as well as platform track utilization costs, subject to constraints defined by operational requirements. Moreover, we design an efficient heuristic algorithm to solve the model with a good precision. A real-world case is taken as an example to show the effectiveness of the proposed model and algorithm. The results show that the model established in this paper can describe re-optimization of train platforming accurately and 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.

Train platforming; Train delay; Re-optimization; Discretization; Heuristic algorithm