| 武警部队快速机动中最优路径的实现 |
| |
| 引用本文： | 罗兆成,杜静. 武警部队快速机动中最优路径的实现[J]. 武警工程学院学报, 2010, 0(4): 11-13 |
| |
| 作者姓名： | 罗兆成 杜静 |
| |
| 作者单位： | 武警上海政治学院武警指挥系,上海200435 |
| |
| 摘 要： | 紧急条件下武警部队快速机动最优路径，是一个多目标多约束随机动态交通网络寻优问题。在分析交通网络拓扑化特点及最短路模型前提下，着重研究道路通行能力带给复杂公路网络道路寻优问题的影响，并结合GIS系统利用改进的Dijkstra算法求解。
|
| 关 键 词： | 快速机动 最优路径 Dijkstra算法 |
The Realization of the Optimal Path of Armed Forces Rapid Mobility |
| |
| LUO Zhao-cheng,DU Jing. The Realization of the Optimal Path of Armed Forces Rapid Mobility[J]. Journal of Engineering College of Armed Police Force, 2010, 0(4): 11-13 |
| |
| Authors: | LUO Zhao-cheng DU Jing |
| |
| Affiliation: | ( Politics College of CAPF, Shanghai 200435, China) |
| |
| Abstract: | Under emergency conditions, optimal path problem of the Armed Police Force rapid mobility is a multi -objective and multi - restriction optimization of stochastic dynamic traffic network . Based on the a- nalysis of the transport network topology features and the shortest - circuit model of the premise, this paper focuses on the effect of traffic ability on optimization problem of complicated road network. Problems are solved by improved Dijkstra algorithm combined with GIS system. |
| |
| Keywords: | rapid mobility optimal path Dijkstra algorithm |
| 本文献已被 维普 等数据库收录！ |
