A Search-Based Approach to Railway Rolling Stock Allocation Problems

Otsuki, Tomoshi; Aisu, Hideyuki; Tanaka, Toshiaki

doi:10.1142/s1793830911001334

Cited by 4 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Budai et al [10] proposed a method to reschedule the train-set circulation plan based on a current timetable, so as to meet the demands of the new timetable. Otsuki et al [11] described the railway rolling stock allocation problem based on a set partitioning multi-commodity flow (SPMCF) problem. Thorlacius et al [12] constructed the rolling stock plan by using a heuristic algorithm.…”

Section: Train-set Rescheduling Problemmentioning

confidence: 99%

A Scheduling Approach for the Train-Set Circulation Plan and Timetable for the Longer Distance High-Speed Railway in Transition Time

et al. 2022

View full text Add to dashboard Cite

Nowadays, high-speed railway (HSR) has become one of the main choices for passengers. As the number of passengers increases, their travel demands become diverse and the fluctuation range of passenger travel demands will also increase. In order to adapt to the change of passenger travel demands, the switching frequency of timetables needs to be increased. When switching the timetable, the train-set circulation plan also needs to be considered. In this paper, a scheduling approach for quickly solving the timetable and the train-set circulation plan in the transition time is proposed. A section sequence is constructed in the integer programming model, and the primary train-set circulation plan is obtained. Then a stop plan is obtained on the basis of passenger travel demands. To obtain the final train-set circulation plan and the timetable, a genetic algorithm (GA) is designed, and a method that can ensure that the timetable meets the safety operation requirements is proposed. The scheduling approach is tested on the Beijing-Shanghai HSR. The results show that by extending the transition time, the scheduling approach can switch the train-set position from the old state to new state, without additional consumption of resources, on the premise of meeting the travel demands of passengers.

show abstract

Section: Train-set Rescheduling Problemmentioning

confidence: 99%

A Scheduling Approach for the Train-Set Circulation Plan and Timetable for the Longer Distance High-Speed Railway in Transition Time

et al. 2022

View full text Add to dashboard Cite

show abstract

“…EMU maintenance must be scheduled with respect to the assigned train tasks; however, EMU‐maintenance‐based mileage limits cannot be directly expressed in a linear form. To manage these mileage limits, various heuristic and intelligent algorithms have been proposed [8–11]. Problems in the second category, in which maintenance is not considered, are predominantly solved using multi‐commodity models [12–16].…”

Section: Introductionmentioning

confidence: 99%