张国强,晏克非.车辆动态导航中Braess悖论的解决方法及其算法设计[J].西安公路交通大学学报,2001,21(4): 29-32. ZHANG Guo-qiang,YAN Ke-fei.Solution of braess' paradox in dynamic vehicle navigation and its design algorithms[J]. Journal of Xi'an Highway University,2001,21(4):29-32.(in Chinese)
[2]
BELLMAN R,KABALA R.On Kth best policies[J].Journal of SIAM,1996,8:582-585.
[3]
SHIER R D.On algorithms for finding the K shortest paths in a network[J].Networks,1979,7(3):341-352.
[4]
EPPSTEIN D.Finding the K shortest paths[C]//Proceeding of the 35th An-nual Symposium on Foundations of Computer Science.USA:IEEE,1994:154-165.
[5]
YEN J Y.Finding the K shortest loopless paths in a network[J].Management Science,1971,17(11):716-721.
[6]
LAWLER.Combinatorial Optimization:Networks and Matroids[M].New York:Courier Dover Publications,1976: 92-104.
[7]
Microsoft Corporation.Visual basic 6.0 programmer's guide[M].USA:Microsoft Press,1999:1172-1205.
[8]
杨兆升.城市交通流诱导系统[M].北京:中国铁道出版社,2004:169-170.
[9]
姜桂艳,郑祖舵,白竹,等.交通拥挤漂移的形成机理与预防技术[J].交通运输工程学报,2007,7(4):93-97. JIANG Gui-yan,ZHENG Zu-duo,BAI Zhu,et al.Causes and preventive technologies of traffic congestion shift[J].Journal of Traffic and Transportation Engineering,2007,7(4):93-97.(in Chinese)
[10]
HOFFMAN W,PAVLEY R.A method for the solution of the Nth best path problem[J].Journal of the Association for Computing Machinery,1959,6:506-514.
