Abstract
The A* algorithm belongs to the class of best first graph-search algorithms and is frequently used to find minimum-cost paths. Recently, A* has been generalised to solve multiple-objective search problems, returning the set of non-dominated solution paths. This paper presents METAL-A*, an admissible heuristic search algorithm for search problems with lexicographic goals that returns the set of non-dominated paths that best achieves a set of lexicographic goals.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mandow, L. Búsqueda Heuristica con Satisfacción de Metas. Tech. Rep. Dpto. Lenguajes y Ciencias Computación. University of Malaga, 1997.
Navinchandra, D. Exploration and Innovation in Design: Towards a computational model. Springer-Verlag, New York, 1991.
Pearl, J. Heuristics. Addison-Wesley, Reading, Mass. 1984.
Stewart, B. and White, C.C. Multiobjective A*, Journal of the ACM, Vol 38, No 4, October 1991, pp 775–814.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mandow, L., Milián, E. (1997). Goal Programming and Heuristic Search. In: Caballero, R., Ruiz, F., Steuer, R. (eds) Advances in Multiple Objective and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol 455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46854-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-46854-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63599-4
Online ISBN: 978-3-642-46854-4
eBook Packages: Springer Book Archive