Optimal Path Searching Method based on Improved Dijkstra Algorithm

被引：0

作者：

Ma, Hui ^{[1
]}

Zhou, Zhizheng ^{[1
,2
]}

Liu, Guangyan ^{[3
]}

机构：

[1] China Univ Geosci Beijing, Sch Geophys & Informat Technol, Beijing, Peoples R China

[2] Shandong Univ Finance, Sch Comp & Informat Engn, Jinan, Peoples R China

[3] Shandong Elect Power Coll, Dept Business Adm, Jinan, Peoples R China

来源：

EPLWW3S 2011: 2011 INTERNATIONAL CONFERENCE ON ECOLOGICAL PROTECTION OF LAKES-WETLANDS-WATERSHED AND APPLICATION OF 3S TECHNOLOGY, VOL 3 | 2011年

关键词：

Optimal Path; Dijkstra Algorithm; Logistics;

D O I：

暂无

中图分类号：

X [环境科学、安全科学];

学科分类号：

08 ; 0830 ;

摘要：

The optimal path no longer refers to the shortest distance in the modern sense, it can also refer to the least time, the least cost, the largest line capacity and so on. The essence of Dijkstra algorithm is to solve the distance of single source and all vertices, when it is used to find the optimal path, there must be redundancy problem. So this paper a two-way Dijkstra algorithm based on the limited rule. Relying on the actual constraints the algorithm constructs a network dynamically, reduces the number of links, and improves the efficiency of finding the optimal path. Through experiments and practical application of the logistics system, it is shown that the algorithm can be selected to meet the logistics' needs to find the optimal path.

引用

页码：567 / 570

页数：4