An empirical comparison of some multiobjective graph search algorithms

Authors:
Enrique Machuca;Lorenzo Mandow;Jose L. Pérez de la Cruz;Amparo Ruiz-Sepulveda
Affiliations:
Dpto. Lenguajes y Ciencias de la Computación, Universidad de Málaga, Málaga, Spain;Dpto. Lenguajes y Ciencias de la Computación, Universidad de Málaga, Málaga, Spain;Dpto. Lenguajes y Ciencias de la Computación, Universidad de Málaga, Málaga, Spain;Dpto. Lenguajes y Ciencias de la Computación, Universidad de Málaga, Málaga, Spain
Venue:
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Year:
2010

Citing 7
Cited 2

Multiobjective A*

Journal of the ACM (JACM)
A comparison of solution strategies for biobjective shortest path problems

Computers and Operations Research
A new approach to multiobjective A* search

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Multiobjective A* search with consistent heuristics

Journal of the ACM (JACM)
A memory-efficient search strategy for multiobjective shortest path problems

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Using bound sets in multiobjective optimization: application to the biobjective binary knapsack problem

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

An analysis of multiobjective search algorithms and heuristics

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
A case of pathology in multiobjective heuristic search

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper compares empirically the performance in time and space of two multiobjective graph search algorithms, MOA* and NAMOA*. Previous theoretical work has shown that NAMOA* is never worse than MOA*. Now, a statistical analysis is presented on the relative performance of both algorithms in space and time over sets of randomly generated problems.