ダイヤ乱れ時における列車乗務員運用整理案の自動作成

Planning, operation, and control of bus transport systems: A literature review

“…Computational experiments show that fewer flight changes are needed, compared with the deterministic approach. Takahashi et al (2008) address re-scheduling decisions for DSP problem, in which, after a disruption occurs, the problem is to minimize the violation of the constraints, such as the number of drivers, train coverage, meal times, continuous shifts, and work time bounds. A TS is designed to solve the problem and the experimentation stage in a real example shows that the solutions generated surpass (in terms of the satisfaction of each constraint) the ones obtained by the manual process employed by the agency.…”

A Lagrangian Relaxation Method for Crew and Vehicle Rescheduling of Railway Passenger Transportation and its Application

“…There exist several specific requirements to realize decision support systems for the CRP/VRP, such as strict time limitation, minimum modification of the original schedule, and close interaction between the user and system. Therefore, influenced by recent growing public concern with rapid traffic recovery for higher transportation services, several solution methods specialized in the CRP/VRP have been proposed (7) (8) .…”

“…Takahashi et al (7) propose a method for the CRP that firstly builds an initial solution by relaxing some constraints and then uses a Taboo-search method to revise the solution to the one with less constraint violations. On numerical experiment applying to actual cases of traffic disruption, the method generated a solution not only satisfying constraints but also equivalent to the schedule by experts.…”