[1] |
Gianlorenzo D’Angelo, Mattia D’Emidio, Daniele Frigioni. A Loop-free Shortest-path Routing Algorithm for Dynamic Networks[J]. Theoretical Computer Science (S0304-39), 2014(516): 1-19
|
[2] |
Yi-zhou Chen, Shi-fei Shen, Tao Chen, et al. Path Optimization Study for Vehicles Evacuation Based on Dijkstra Algorithm[J]. Procedia Engineering (S1877-7058), 2014( 71): 159-165.
|
[3] |
Jinha Kim, Wook-Shin Han, Jinoh Oh, et al.Processing Time-dependent Shortest Path Queries without Pre- computed Speed Information on Road Networks[J]. Information Sciences (S0020-0255), 2014 (255): 135-154.
|
[4] |
Andrei Lissovoi, Carsten Witt.Runtime Analysis of Ant Colony Optimization on Dynamic Shortest Path Problems[J]. Theoretical Computer Science (S0304-3975), 2015(561): 1605-1612.
|
[5] |
Guisong Liu, Zhao Qiu, Hong Qun, et al.Computing k Shortest Paths Using Modified Pulse-coupled Neuralnetwork[J]. Neurocomputing (S0925-2312), 2015 (149): 1162-1176.
|
[6] |
Justin Yates, Sujeevraja Sanjeevi.A Length-based Multiple-resource Formulation for Shortest Path Network Interdiction Problems in the Transportation Sector[J]. International Journal of critical infrastructure protection(S1874-5482), 2013, 6(2):107-119.
|
[7] |
Dreyfus S E.An Appraisal of Some Shortest Path Algorithms[J]. Operations Research(S1109-2858), 1969, 17(3): 395-412.
|
[8] |
Kaufman D E, Smith R L.Fastest Path in Time-dependent Networks for Intelligent Vehicle- highway Systems Application[J]. IVHS Journal (S1547-2442), 1993, 11(1): 1-11.
|
[9] |
Liang Wen, Bülent Catay, Richard Eglese.Finding a Minimum Cost Path between a Pair of Nodes in a Time-varying Road Network with a Congestion Charge[J]. European Journal of Operational Research (S0377-2217), 2014 (236): 915-923.
|
[10] |
Derya Sever, Nico Dellaert, Tom van Woensel, et al. Dynamic shortest path problems: Hybrid Routing Policies Considering Network Disruptions[J]. Computers & Operations Research (S0305-0548), 2013, 40(12): 2852-2863.
|
[11] |
Jianhang Gao, Qing Zhao. Dynamic Shortest Path Algorithms for Hypergraphs [C/OL]//IEEE ACM Transactions on Networking, 2015. http://www.ieee. org/publications_standards/publications/rights/index.html for more information.
|
[12] |
张明川. 生物启发的智慧路由机制与协议研究[D]. 北京: 北京邮电大学, 2014. Mingchuan Zhang. Research on Bio-inspried Smart Routing Mechanism and Protocols[D]. Beijing: Beijing University of Posts and Telecommunications, 2014.
|
[13] |
郑皓天. 基于带宽剩余率的脉冲耦合神经网络最短路径搜索[D]. 上海: 复旦大学, 2013. Zheng Haotian. The search of the shortest path based on the pulse coupled neural network [D]. Shanghai: Fudan University, 2013.
|
[14] |
王宇鹏. 基于分时隙通信的卫星网络路由算法研究[D]. 北京: 北京邮电大学, 2014. Wang Yupeng. Routing Algorithm Research of Satellite Network Based on Timeslot Communication[D]. Beijing: Beijing University of Posts and Telecommunications, 2014.
|
[15] |
杨建芳, 高岩, 王宏杰. 多层建筑物应急疏散模型和算法[J]. 系统仿真学报, 2014, 16(2): 267-273. Yang Jianfang, Gao Yan, Wang Hongjie. Multi-storied Building Emergency Evacuation Model and Algorithm [J]. Journal of System Simulation, 2014, 16(2): 267-273.
|