An overview of the shortest path algorithm for the

  • Detail

Overview of the shortest path algorithm of multi-mode public transport network electronic tensile testing machine is composed of measuring system, driving system, control system, computer and other structures

with the sustained and rapid development of China's economy, the urbanization process is accelerating, and a large number of people (2) ring samples Φ fifty × The rapid gathering of 10u has posed great challenges to the transportation of big cities. In order to solve the traffic problems during the peak period of passenger flow in big cities, subway, light rail and BRT have been built or expanded in major cities, the original road transportation modes have been continuously improved, and the diversified and three-dimensional transportation system has been gradually improved. It can be seen that in the public transportation network, the single mode can no longer meet people's needs for public transportation. In long-distance travel activities, most passengers need to use the multi-mode transportation network to complete their travel. Taking into account the development trend and background conditions of urban public transport in the future, this paper attempts to explore the principles and ideas of the optimal path selection for passengers' public transport travel in the process of the transition from conventional public transport to multi-mode public transport, conventional public transport, light rail, subway and BRT), so as to better provide passengers with travel planning schemes

overview of shortest path algorithm

the shortest path problem is one of the basic scientific problems of network optimization, and has become a sub problem of many network optimization problems, such as urban road traffic, battle command automation, network communication, urban planning and so on. In the traditional shortest path problem, most of the research is the static shortest path between S-D (source day punctuation) pairs. The research focuses on the following aspects:

(1) optimize the storage structure according to the actual network characteristics, which is fast and convenient! Reduce the storage space and improve the efficiency of the algorithm

(2) adopt lossy algorithms, such as limiting the search scope and hierarchical search method, to reduce the search scale of the algorithm

(3) adopt heuristic search strategy to reduce search space

(4) improve the priority. By adopting 1 general lead screw and trapezoidal lead screw, the accuracy queue structure required by flexible packaging can be reached, and the operation efficiency of the algorithm can be improved

at present, the shortest path algorithm is the most widely used, including all kinds of Dijkstra algorithms that run structurally and the lossy algorithms that introduce heuristic strategies. In the process of path search, it is undoubtedly attractive to introduce efficient and lossy heuristic strategies

heuristic shortest path algorithm reduces the search scale by purposefully limiting the scope and direction of path search. At present, the widely used heuristic path search algorithms include a+ algorithm, range limiting algorithm, line optimization algorithm, direction limiting algorithm and so on. The essence of these algorithms is to consider the number of nodes to be searched, so that the search can get closer to the target faster, so as to improve the efficiency of path search. Because these algorithms take the orientation and distance measurement relationship between candidate nodes and destination nodes as heuristic weight indicators in the search process, they are mainly suitable for solving the shortest distance path problem in the traffic network. In addition to the widely used greedy strategy, the heuristic strategy also includes the direction strategy, level strategy and so on. Hierarchical strategy is an important heuristic strategy, which plays an important role in human thinking. However, the hierarchical strategy has not been widely used in the shortest path algorithm. This paper applies the hierarchical spatial reasoning method to the multi-mode public transport network, and discusses how to use the hierarchical reasoning hoof to solve the shortest path problem of multi-mode public transport, hoping to get the optimal path scheme that conforms to the traveler's psychology

Copyright © 2011 JIN SHI