A Shortest Path Algorithm Based on Limited Search Heuristics
From MaRDI portal
Recommendations
- The shortest-path problem. Analysis and comparison of methods
- Heuristic shortest path algorithms for transportation applications: state of the art
- scientific article; zbMATH DE number 1054931
- The shortest path problem on large-scale real-road networks
- Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
Cited in
(13)- T*: a weighted double-heuristic search algorithm to find the shortest path
- Heuristic shortest path algorithms for transportation applications: state of the art
- An efficient algorithm for computing least cost paths with turn constraints
- N-shortest paths retrieval algorithm based on artificial immunity
- scientific article; zbMATH DE number 6500497 (Why is no real title available?)
- Shortest path algorithm confined to conditions in grid data model
- scientific article; zbMATH DE number 4035604 (Why is no real title available?)
- scientific article; zbMATH DE number 1054931 (Why is no real title available?)
- Study on planning method of optimum route in multi-scale road network based on Dijkstra's algorithm
- A heuristic optimization path-finding algorithm based on Dijkstra algorithm
- Solving the constrained shortest path problem using random search strategy
- Computational Science - ICCS 2004
- Heuristic search for one-to-many shortest path queries
This page was built for publication: A Shortest Path Algorithm Based on Limited Search Heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434721)