A memory-efficient search strategy for multiobjective shortest path problems

Authors:
L. Mandow;J. L. Pérez De La Cruz
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
Venue:
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Year:
2009

Citing 7
Cited 3

Multiobjective A*

Journal of the ACM (JACM)
Frontier search

Journal of the ACM (JACM)
Multicriteria Optimization

Multicriteria Optimization
A comparison of solution strategies for biobjective shortest path problems

Computers and Operations Research
Frontier Search for Bicriterion Shortest Path Problems

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A multiobjective frontier search algorithm

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
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)
An empirical comparison of some multiobjective graph search algorithms

KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Multiobjective heuristic search in road maps

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper develops vector frontier search, a new multiobjective search strategy that achieves an important reduction in space requirements over previous proposals. The complexity of a resulting multiobjective frontier search algorithm is analyzed and its performance is evaluated over a set of random problems.