A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line
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 fi...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2020/3809734 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849687038553489408 |
|---|---|
| author | Qingwei Zhong Yongxiang Zhang Dian Wang Qinglun Zhong Chao Wen Qiyuan Peng |
| author_facet | Qingwei Zhong Yongxiang Zhang Dian Wang Qinglun Zhong Chao Wen Qiyuan Peng |
| author_sort | Qingwei Zhong |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-02280c85e78f4210b8239fcdcf33d4f7 |
| institution | DOAJ |
| issn | 0197-6729 2042-3195 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-02280c85e78f4210b8239fcdcf33d4f72025-08-20T03:22:27ZengWileyJournal of Advanced Transportation0197-67292042-31952020-01-01202010.1155/2020/38097343809734A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit LineQingwei Zhong0Yongxiang Zhang1Dian Wang2Qinglun Zhong3Chao Wen4Qiyuan Peng5School of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610031, Sichuan, ChinaSchool of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610031, Sichuan, ChinaSchool of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610031, Sichuan, ChinaInstitut für Eisenbahnwesen und Verkehrssicherung Technische Universität Braunschweig, Pockelsstr. 3, 38106 Braunschweig, GermanySchool of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610031, Sichuan, ChinaSchool of Transportation and Logistics, Southwest Jiaotong University, Chengdu 610031, Sichuan, ChinaIn 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.http://dx.doi.org/10.1155/2020/3809734 |
| spellingShingle | Qingwei Zhong Yongxiang Zhang Dian Wang Qinglun Zhong Chao Wen Qiyuan Peng A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line Journal of Advanced Transportation |
| title | A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line |
| title_full | A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line |
| title_fullStr | A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line |
| title_full_unstemmed | A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line |
| title_short | A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line |
| title_sort | mixed integer linear programming model for rolling stock deadhead routing before the operation period in an urban rail transit line |
| url | http://dx.doi.org/10.1155/2020/3809734 |
| work_keys_str_mv | AT qingweizhong amixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT yongxiangzhang amixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT dianwang amixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT qinglunzhong amixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT chaowen amixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT qiyuanpeng amixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT qingweizhong mixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT yongxiangzhang mixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT dianwang mixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT qinglunzhong mixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT chaowen mixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline AT qiyuanpeng mixedintegerlinearprogrammingmodelforrollingstockdeadheadroutingbeforetheoperationperiodinanurbanrailtransitline |