Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic route planning for car navigation systems using virus genetic algorithms
International Journal of Knowledge-based and Intelligent Engineering Systems
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A comparison of solution strategies for biobjective shortest path problems
Computers and Operations Research
Search for Compromise Solutions in Multiobjective State Space Graphs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Multiobjective A* search with consistent heuristics
Journal of the ACM (JACM)
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A memory-efficient search strategy for multiobjective shortest path problems
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Hierarchical A *: searching abstraction hierarchies efficiently
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Hierarchical heuristic search revisited
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Preprocessing speed-up techniques is hard
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
An evaluation of multiobjective urban tourist route planning with mobile devices
UCAmI'12 Proceedings of the 6th international conference on Ubiquitous Computing and Ambient Intelligence
Hi-index | 12.05 |
This article considers the application of exact multiobjective techniques to search in large size realistic road maps. In particular, the NAMOA^* algorithm is successfully applied to several road networks from the DIMACS shortest path implementation challenge with two objectives. An efficient heuristic function previously proposed by Tung and Chew is evaluated. Heuristic values are precalculated with search. The precalculation effort is shown to pay off during the multiobjective search stage. An improvement to the calculation procedure is also proposed, resulting in added improved time performance in many problem instances.