[1] 陆化普,秦旭彦,马洪. 若干交通分配方法的比较研 究[J]. 公路工程, 2008, 33(5): 48-51. [LU H P, QIN X Y, MA H. Comparison research of several traffic assignment methods[J]. Highway Engineering, 2008, 33 (5): 48-51].
[2] EASA S M. Traffic assignment in practice: overview and guidelines for users[J]. Journal of Transportation Engineering Asce, 1991, 117(6): 602-623.
[3] J FENG, Y L ZHU, et al. Search on transportation network for location- based service[J]// Proceedings of Innovations in Applied Artificial Intelligence, Lecture Notes in Artificial Intelligence. Springer, Italia. 2005 (3533): 657-666.
[4] 刘灿齐. 车流在交叉口分流向延误的最短路径及 算法[J]. 同济大学学报(自然科学版), 2002, 30(1): 52- 56. [LIU C Q, Shortest path including delay of each flow at intersection and its algorithm[J]. Journal of Tongji University(Natural Science Edition), 2002, 30(1): 52-56.]
[5] 任刚,王炜. 基于转向的Logit交通分配算法[J]. 交通 运输工程学报, 2005, 5(4): 101-105. [REN G, WANG W. Turn-based algorithm for logit traffic assignment[J]. Journal of Traffic and Transportation Engineering, 2005, 5(4): 101-105.]
[6] 王树盛,黄卫,陆振波. 路阻函数关系式推导及其拟合 分析研究[J]. 公路交通科技, 2006, 23(4):107-110. [WANG S S, HUANG W, LU Z B. Deduction of link performance function and its regression analysis[J]. Journal of Highway and Transportation Research and Development, 2006, 23(4): 107-110.]
[7] DAVIDSON K B. The theoretical basis of a flow-travel time relationship for use in transportation planning[J]. Australian Road Research, 1978, 8(1): 32-35.
[8] 任刚,王炜,邓卫. 带转向延误和限制的最短路径问题 及其求解方法[J]. 东南大学学报(自然科学版), 2004, 34(1): 104- 108. [REN G, WANG W, DENG W. Shortest path problem with turn penalties and prohibitions and its solution[J]. Journal of Southeast University(Natural Science Edition), 2004, 34(1): 104- 108.] |