OD-independent train scheduling for an urban rail transit line

Abstract

In the previous two chapters, we have discussed trajectory planning for trains in a railway network based on given train schedules. In this chapter, the train scheduling problem based on origin-destination-independent (OD-independent) passenger demands for an urban rail transit line is considered with the aim of minimizing the total travel time of passengers and the energy consumption of trains.We propose a new iterative convex programming (ICP) approach to solve this train scheduling problem. Via a case study inspired by the Beijing Yizhuang line, the performance of the ICP approach is compared with other alternative approaches, such as nonlinear programming approaches, a mixed integer nonlinear programming (MINLP) approach, and a mixed integer linear programming (MILP) approach. The research discussed in this chapter is based onWang et al. (Efficient real-time train scheduling for urban rail transit systems using iterative convex programming. IEEE Trans Intell Transp Syst 16: 3337-3352, 2015) [1];Wang et al. (Proceedings of the 1st IEEE international conference on intelligent rail transportation (2013 IEEE ICIRT), Beijing, China, 2013) [2]; Wang et al. (Proceedings of the 16th international IEEE conference on intelligent transportation systems (ITSC 2013), The Netherlands, The Hague, pp 1334-1339, 2013) [3].