Following the vigorous construction of passenger dedicated lines, these lines with several types will be introduced into each large railway terminal when one such terminal with two or more passenger stations inside, it is necessary to allocate the task of receiving-departing passenger trains for each passenger station, so the passenger station task allocation problem was proposed. Aiming at minimizing passenger costs in terminal, taking passenger station and railway line capacity and passenger transportation demands as constraints, a passenger flow's path-based nonlinear mixed integer programming model was established. Combining with the feature of this model and this problem, an exact algorithm was designed based on enumeration, k-shortest and linear programs by simplified that model. This method could determine the task allocation plan of each passenger station, the running paths of each passenger flow and the capacity utilization situation of each passenger station and railway line, and help to assist the planners to make decisions.
Model and Algorithm for Passenger Station Task Allocation Problem in Railway Terminal
Tenth International Conference of Chinese Transportation Professionals (ICCTP) ; 2010 ; Beijing, China
ICCTP 2010 ; 2590-2596
2010-07-22
Conference paper
Electronic Resource
English
Model and Algorithm for Passenger Station Task Allocation Problem in Railway Terminal
British Library Conference Proceedings | 2010
|British Library Conference Proceedings | 2010
|Railway passenger terminal problem at Chicago
Engineering Index Backfile | 1933