Dynamic shortest path planning method based on improved Dijkstra algorithm
A shortest path, dynamic technology, applied in the application field, can solve the problems of not considering the actual road network constraints, the low efficiency of the algorithm queue structure, etc., to achieve the effect of reducing space complexity and time complexity
Inactive Publication Date: 2019-12-03
ZHEJIANG UNIV OF TECH
View PDF3 Cites 4 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0006] In order to solve the shortcomings of the existing dynamic shortest path planning method road network storage structure and algorithm queue structure, which have low efficiency and do not consider the actual road network constraints, the present invention proposes a dynamic shortest path planning method based on the improved Dijkstra algorithm. On the basis of the actual road network constraints, it reduces the space complexity of road network storage and the time complexity of algorithm search, improves the efficiency of algorithm execution, and finally achieves the purpose of improving the real-time performance and accuracy of planning methods
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0041] The present invention will be further described below in conjunction with the accompanying drawings.
[0042] refer to figure 1 and figure 2 , a dynamic shortest path planning method based on the improved Dijkstra algorithm, including the following steps:
[0043] 1) Input the road network G(V(t) in a certain area of a given city i ),E(t i )), where V(t i ) for t i The collection of nodes in the time period road network, E(t i ) for t i The set of directed edges in the time period road network, G(V(t i ),E(t i )) is a directed weighted graph;
[0044] 2) Initialization, the process is as follows:
[0045] 2.1) Initialize the current period t k , let t k = t 0 , t 0 for the departure period;
[0046] 2.2) Initialize the current time T c , let T c =T dep (T dep ∈t 0 ), where T dep is the time of departure;
[0047] 2.3) Initialize the shortest time vector d(t k ) = [d(v 0 ,t k ),d(v 1 ,t k ),…,d(v i ,t k ),…,d(v n ,t k )], where d(v i ,t...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention provides a dynamic shortest path planning method based on an improved Dijkstra algorithm. An adjacency list is used as a storage mode of road network data, thereby reducing the space complexity when the algorithm stores a sparse map, and meanwhile, a Fibonacci heap is used as a queue structure of the algorithm, so that the time complexity during algorithm search is reduced by using the heap order property of the Fibonacci heap; and finally, in consideration of the actual road network constraints, a road section passing speed and a heap structure corresponding to a road network are updated in time periods, so that the algorithm can plan a shortest path scheme in the dynamic road network in real time. The dynamic shortest path planning method based on the improved Dijkstra algorithm provided by the invention has instantaneity and accuracy.
Description
technical field [0001] The invention relates to the application fields of logistics distribution, transportation, intelligent optimization, network analysis, etc., and in particular to a dynamic shortest path planning method based on the improved Dijkstra algorithm. Background technique [0002] With the rapid development of my country's economy, how to reduce the cost of logistics and distribution has become an important bottleneck restricting the development of enterprises. In the operating costs of enterprises, logistics and distribution costs account for a considerable proportion. Reducing logistics costs can effectively reduce enterprise operating costs and improve resource utilization. For enterprises, establishing an efficient logistics system can improve service levels. For customers, a complete logistics distribution system is an important guarantee for offline delivery of most products. At the same time, with the rapid development of my country's information techn...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Applications(China)
IPC IPC(8): G01C21/34
CPCG01C21/3446G01C21/3453
Inventor 张贵军武楚雄陈驰周晓根刘俊袁丰桥
Owner ZHEJIANG UNIV OF TECH