Management of Urban Transit[M].Beijing:China Railway Publishing House, 2001.
[3]
SONG Rui.Study on Transportation Management Model and Optimal Decision of ITS[D].Beijing:Northern Jiaotong University, 1999.
[4]
ZHANG Fei-zhou, YAN Lei, FAN Yue-zu, et al.Research on Dispatching Methods of Public Traffic Vehicles in Intelligent Transportation System[J].China Journal of Highway and Transport, 2003, 16(2):82-85.
[5]
WANG Feng-yuan, PAN Fu-quan, ZHANG Li-xia, et al.Optimal Path Algorithm of Road Network with Traffic Restriction[J].Journal of Traffic and Transportation Engineering, 2005, 5(1):92-95.
[6]
NGUYEN S, PALLOTTINO S, MALUCELLI F.A Modeling Framework for Passenger Assignment on a Transport Network with Time Tables[J].Transportation Science, 2001, 35(3):238-249.
[7]
BARNHART C, JOHNSON E L, NEMHAUSER G L, et al.Branch-Price:Column Generation for Solving Huge Integer Programs[J].Operations Research, 1998, 46(3):316-329.
[8]
AHUJA R K, MAGNANTI T L, ORLIN J B.Network Flows, Theory, Algorithms and Applications[M].New Jersey:Prentice Hall, 1993.
HICKMAN M D, BERNSTEIN D H.Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks[J].Transportation Science, 1997, 31(2):129-146.
[14]
TONG C O, WONG S C.A Stochastic Transit Assignment Model Using a Dynamic Schedule-Based Network[J].Transportation Research, 1999, 33(2):107-121.
[15]
VANDERBECK F.On Dantzig-Wolfe Decomposition in Integer Programming and Ways to Perform Branching in a Branch-and-Price Algorithm[J].Operations Research, 2000, 48(1):111-128.
