Frontier Search for Bicriterion 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 29071-Málaga (Spain). {lawrence, perez}@lcc.uma.es;Dpto. Lenguajes y Ciencias de la Computación. Universidad de Málaga 29071-Málaga (Spain). {lawrence, perez}@lcc.uma.es
Venue:
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Year:
2008

Citing 6
Cited 3

Multiobjective A*

Journal of the ACM (JACM)
Frontier search

Journal of the ACM (JACM)
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
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
Comparison of heuristics in multiobjective a* search

CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence

A memory-efficient search strategy for multiobjective shortest path problems

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
A Label Correcting Algorithm for the Bus Routing Problem

Fundamenta Informaticae
A comparison of multiobjective depth-first algorithms

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Frontier search is a new search technique that achieves important memory savings over previous best-first search algorithms. This paper describes an extension of frontier search to bicriterion graph search problems that achieves also important memory savings. The new algorithm is evaluated using a set of random problems.