TOMKEWITSCH R V. Dynamic route guidance and interactive transport management with ALI-SCOUT[J]. IEEE Transactions on Vehicular Technology, 1991, 40(1): 45-50.
[2]
DEO N, PANG Chi-yin. Shortest path algorithms: taxonomy and annotation[J]. Networks, 1984, 14(2): 275-323.
[3]
O’CEARBHAILL E A, O’MAHONY M. Parallel implementation of a transportation network model[J]. Journal of Parallel and Distributed Computing, 2005, 65(1): 1-14.
[4]
王 媛.大范围战略交通协调控制系统关键技术研究[D].长春:吉林大学,2009. WANG Yuan. Research on key technologies of large-scale strategic traffic coordination and control system[D]. Changchun: Jilin University, 2009.(in Chinese)
[5]
李丽丽.基于拓扑关系的导航电子地图增量更新关键技术研究[D].长春:吉林大学,2009. LI Li-li. Key technology research of incremental updating of electronic navigation map based on topological relationship[D]. Changchun: Jilin University, 2009.(in Chinese)
[6]
陈 洁,陆 锋.一种基于双端队列的交通网络最短路径Pallottino优化算法[J].中国图象图形学报,2006,11(3):419-424. CHEN Jie, LU Feng. An optimization algorithm of Pallottino implemented with two queues in transportation network[J]. Journal of Image and Graphics, 2006, 11(3): 419-424.(in Chinese)
[7]
SUNDELL H, TSIGAS P. Lock-free deques and doubly linked lists[J]. Journal of Parallel and Distributed Computing, 2008, 68(7): 1008-1020.
[8]
MEYERHENKE H, MONIEN B, SAUERWALD T. A new diffusion-based multilevel algorithm for computing graph partitions[J]. Journal of Parallel and Distributed Computing, 2009, 69(9): 750-761.
[9]
KARYPIS G, KUMAR V. Multilevel k-way partitioning scheme for irregular graphs[J]. Journal of Parallel and Distributed Computing, 1998, 58(1): 96-129.
[10]
ZHAN F B, NOON C E. Shortest path algorithms: an evaluation using real road networks[J]. Transportation Science, 1998, 32(1): 65-73.
[11]
ZHAN F B. Three fastest shortest path algorithms on real road networks: data structures and procedures[J]. Journal of Geographic Information and Decision Analysis, 1997, 1(1): 70-82.
[12]
MEYER U. Design and analysis of sequential and parallel single-source shortest-paths algorithms[D]. Saarbrücken: Universit？t des Saarlandes, 2002.
[13]
MEYER U, SANDERS P. Δ-stepping: a parallelizable short-est path algorithm[J]. Journal of Algorithms, 2003, 49(1): 114-152.
