An optimum vehicular path solution with multi-heuristics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3039, Issue , 2004, Pages 964-971

  Lu, Feng ^a   Guan, Vanning ^b  

^a INSTITUTE OF GEOGRAPHIC SCIENCES AND NATURAL RESOURCES RESEARCH   (China)

^b INSTITUTE OF REMOTE SENSING APPLICATIONS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ROADS AND STREETS;

GREEDY HEURISTICS; HIERARCHICAL SPATIAL REASONING; HIERARCHICAL STRUCTURES; OPTIMUM PATHS; PATH FINDING; PATH FINDING PROBLEMS; REAL ROAD NETWORKS; S-ALGORITHMS;

OPTIMIZATION;

EID: 33745899472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25944-2_124     Document Type: Article

References (15)

1. Deo N. and Pang C.Y., Shortest-path algorithms: taxonomy and annotation, Networks, 4(1984) 275-323.
2. Cherkassky B.V., Goldberg A.V. and Radzik T., Shortest paths algorithms: theory and experimental evaluation, Mathematical Programming, 73(1996) 129-174.
3. Fisher P. F., A primer of geographic search using artificial intelligence, Computers & Geosciences, 16(1990) 753-776.
4. Winston, P. H., Artificial Intelligence, 1st edn. Reading: Addison-Wesley, Massachusetts (1984).
5. Pallottino S., Shortest-path methods: complexity, interrelations and new propositions, Networks, 14(1984)257-267.
6. Ahuja R.K., Mehlhorn K., Orlin J.B. and Tarjan R.E., Faster algorithms for the shortest path problem, Journal of the Association for Computing Machinery, 37(1990) 213-223.
7. Zhan F.B. and Noon C.E., Shortest path algorithms: an evaluation using real road networks, Transportation Science, 32(1998) 65-73.
8. Lester P, A* Pathfinding for Beginners, URL: http://www.policyalmanac.org/games/aStarTutorial.htm (2003).
9. Pallotlino S. and Scutella M. G, Shortest path algorithms in transportation models: classical and innovative aspects, Technical Report, Universita di Pisa (1997).
10. Goldberg A.V. and Tarjan R.E., Expected performance of Dijkstra's shortest path algorithm, Technical Report No. PRINCETONCS//TR-530-96, Princeton University (1996).
11. Tarjan R.E., Data Structures and Network Algorithms, 1st edn. Society for Industrial and Applied Mathematics Press, Philadelphia (1983).
12. Lu F., Zhou C.H. and Wan Q., An improved Dijkstra's shortest path algorithm based on quad heap priority queue and MBR searching method, Proceedings of the 9th Spatial Data Handling Symposium, (2000) 6b:3-13.
13. Fredman M.L. and Tarjan R.E., Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the Association for Computing Machinery, 34(1987) 596-615.
14. Nordbeck, S. and Rystedt, B., Computer cartography - range map, BIT, 9(1969), 157-166.
15. Car A. and Frank A., General principles of hierarchical spatial reasoning-the case of wayfinding, Proceedings of the 6th International Symposium on Spatial Data Handling, (1994) 646-664.