WIT Press

A Heuristic Algorithm For The Circulation Plan Of Railway Electrical Motor Units


Free (open access)

Paper DOI






Page Range

877 - 888




378 kb


J. Miao, Y. Yu & Y. Wang


The rolling stock rostering problem with maintenance constraints is NP-hard. In this paper, a two-stage approach is proposed. Relaxing the maintenance constraints, a transition network with minimum train unit is established in the first stage. A heuristic algorithm based on the transitions interchange is devised to search for a feasible maintenance route. The algorithm is verified with the operational timetable of Guangzhou-Shenzhen railway, and the performance is satisfactory. Without consideration of empty movements, the algorithm can just be applied in the situation where the depots are well planned. Keywords: electrical motor units, circulation plan, heuristic algorithm. 1 Introduction Before the year 2007, all the passenger trains on the traditional railway lines in China were built-up with locomotive(s) and cars. The locomotives and passenger car fleets are managed under a different department and operated separately according to different plans. As the passenger trains often run across great distances and take several days, most of the trains are allocated with multiple car fleets. A car fleet is often assigned to execute a given train, except for a few short-distance trains. The composition of fleets often persists over a relatively long time unless there is maintenance. With the train speed upgrade project and the development and operation of passenger dedicated rail lines, Electrical Motor Units (EMU) are employed in the operation of high-speed trains which run at 200-300km/h speed. There are two


electrical motor units, circulation plan, heuristic algorithm