A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line

Abstract

In an urban rail transit line, train services are performed by the rolling stocks that are initially stored at depots. Before the start of the operation period, rolling stocks consecutively leave the depots and run without passengers (deadhead routing) to the origin station of their corresponding first departure train service in an operation day (first train service) using either direct or indirect routes. This paper investigates the rolling stock deadhead routing problem in an urban transit line with multiple circulation plans, depots, and rolling stock types. Given the rolling stock circulation plans, the problem is to identify a deadhead route for the rolling stock required by the train services to cover the initial operation. By pregenerating all direct and indirect candidate deadhead routes in a polynomial manner, the problem is then nicely formulated as a mixed integer linear programming (MILP) model to minimize the total deadhead mileages. A real-world case from the urban rail transit line 3 of Chongqing in China is adopted to test the proposed method. Computational results demonstrate that the problems of large-scale instances can be quickly solved to optimality by commercial optimization solvers on a personal computer. In addition, our optimization method is better than the empirical practices in terms of the solution quality. Meanwhile, alternative measures can further decrease the total deadhead mileages according to the proposed model, e.g., opening idle switch stations and prolonging the time that is used for the rolling stock departure. Finally, the model is further extended to consider operating costs, and more computation cases are tested for better adapting to the practical operating conditions.

A Fast Approach for Reoptimization of Railway Train Platforming in Case of Train Delays

“…First, instead of ensuring the arrival and departure safety headway between two different trains running in the same direction, the explicit consideration of train entrance and exit route conflicts can increase the station throughput capacity and reduce the train delays [10,20]. Second, the MILP model and the heuristic algorithm GSAHA proposed in this paper can be further developed to consider different station types, such as the terminal station where trains need to perform the turnaround movement that makes the train platforming problem more complicated [42,43]. ird, the train movements at the stations can be viewed as a set of space-time paths, and thus more efficient dual decomposition methods could be developed accordingly [7,44,45].…”

Evaluating Railway Operation Safety Situation in China Based on an Improved TOPSIS Method: A Regional Perspective

“…Method extensions and practical applications were also discussed. In addition, evaluation work can be further combined with other transportation organization or disruption management research to formulate collaborative optimization strategies, such as robust train timetabling [57], train platforming [58], rolling stock scheduling [59], and energy saving [60]. e method of parameter estimation needs to be improved.…”

Factor and Influential Variables Affecting Maintenance Cost ofUrban Rail Rolling Stock

“…The study by Borndörfer, et al [51] indicates that spacing allocation to perform maintenance involving maintenance pit (infrastructure capacity) is included in constraint for rolling stock practitioner to perform appropriate maintenance activity. According to the research conducted by Zhong, et al [52] and Giacco, et al [53], the location of the fleet part also contributes to the maintenance cost. These studies have shown that, TOC with mixed fleets has to find tune strategic location and size of the fleet park within their network.…”