An N-Shortest-Paths Algorithm Implemented with Bidirectional Search
نویسندگان
چکیده
To save the escaping time for the coal mine flood, improve the emergency rescue efficiency, an NShortest Paths algorithm utilized bidirectional search is presented, which is based on the classical Dijkstra algorithm. The algorithm was proposed roadway length equivalent weights to simulate the mine roadway length. Combined with GIS theory to extract topology structure of mine, an undirected weighted graph was constructed. With the above optimization algorithm, at the end of the paper, it was simulated using MATLAB. Simulation results demonstrate the feasibility and accuracy of the algorithm.
منابع مشابه
Finding Shortest Paths With Computational Geometry
We present a heuristic search algorithm for the R Manhattan shortest path problem that achieves front-to-front bidirectionality in subquadratic time. In the study of bidirectional search algorithms, front-to-front heuristic computations were thought to be prohibitively expensive (at least quadratic time complexity); our algorithm runs in O(n log n) time and O(n logd−1 n) space, where n is the n...
متن کاملA new bidirectional algorithm for shortest paths
For finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. The version of bidirectional A* that is considered the most appropriate in literature hitherto, uses so-called balanced heuristic estimates. This means that the two estimates of the two directions are in ba...
متن کاملYet another bidirectional algorithm for shortest paths
For finding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. The version of bidirectional A* that is considered the most appropriate in literature hitherto, uses so-called balanced heuristic estimates. This means that the two estimates of the two directions are in ba...
متن کاملBidirectional A* Search for Time-Dependent Fast Paths
The computation of point-to-point shortest paths on timedependent road networks has many practical applications, but there have been very few works that propose efficient algorithms for large graphs. One of the difficulties of route planning on time-dependent graphs is that we do not know the exact arrival time at the destination, hence applying bidirectional search is not straightforward; we p...
متن کاملImplementations of routing algorithms for transportation networks
We discuss the generalization of the point-to-point (and single-source) shortest path problem to instances where the shortest path must satisfy a formal language constraint. We describe theoretical and experimental results on a generalization of Dijkstra’s algorithm to finding regular-language-constrained shortest paths. This algorithm forms a model for single-source shortest paths and point-to...
متن کامل