research-article

Multiobjective A^* search with consistent heuristics

Authors:

Lawrence Mandow,

José. Luis Pérez De La CruzAuthors Info & Claims

Journal of the ACM (JACM), Volume 57, Issue 5

Article No.: 27, Pages 1 - 25

https://doi.org/10.1145/1754399.1754400

Published: 25 June 2008 Publication History

Abstract

The article describes and analyzes NAMOA^*, an algorithm for multiobjective heuristic graph search problems. The algorithm is presented as an extension of A^*, an admissible scalar shortest path algorithm. Under consistent heuristics A^* is known to improve its efficiency with more informed heuristics, and to be optimal over the class of admissible algorithms in terms of the set of expanded nodes and the number of node expansions. Equivalent beneficial properties are shown to prevail in the new algorithm.

References

[1]

Alechina, N., and Logan, B. 2001. State space search with prioritised soft constraints. Appl. Intell. 14, 3, 263--278.

Digital Library

[2]

Bentley, J., Kung, H., Schkolnick, M., and Thomson, C. 1978. On the average number of maxima in a set of vectors and applications. J. ACM 25, 4 (Oct.), 536--543.

Digital Library

[3]

Dasgupta, P., Chakrabarti, P., and DeSarkar, S. 1995. Utility of pathmax in partial order heuristic search. Inf. Proc. Lett. 55, 317--322.

Digital Library

[4]

Dasgupta, P., Chakrabarti, P., and DeSarkar, S. 1999. Multiobjective Heuristic Search. Vieweg, Braunschweig/Wiesbaden.

[5]

Dechter, R., and Pearl, J. 1985. Generalized best-first search strategies and the optimality of A^&ast;. J. ACM 32, 3 (July), 505--536.

Digital Library

[6]

Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 269--271.

Digital Library

[7]

Gabrel, V., and Vanderpooten, D. 2002. Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite. Europ. J. Operat. Res. 139, 533--542.

[8]

Hansen, P. 1979. Bicriterion path problems. In LNEMS 177. Springer, 109--127.

[9]

Hart, P., Nilsson, N., and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet. 2, 100--107.

[10]

Loui, R. P. 1983. Optimal paths in graphs with stochastic or multidimensional weights. Comm. ACM 26, 9 (Sept.), 670--676.

Digital Library

[11]

Mahanti, A., and Ray, K. 1988. Network search algorithms with modifiable heuristics. In Search in Artificial Intelligence. Springer-Verlag, Berlin, Germany, 200--222.

Digital Library

[12]

Mandow, L., and Pérez de la Cruz, J. L. 2003. Multicriteria heuristic search. Europ. J. Operat. Res. 150, 253--280.

[13]

Mandow, L., and Pérez de la Cruz, J. L. 2005. A new approach to multiobjective A^&ast; search. In Proceedings of the XIX International Joint Conference on Artificial Intelligence (IJCAI'05). 218--223.

Digital Library

[14]

Mandow, L., and Pérez de la Cruz, J. L. 2006. Comparison of heuristics in multiobjective A^&ast; search. In CAEPIA'05. Lecture Notes in Artificial Intelligence, vol. 4177. Springer-Verlag, Berlin, Germany, 180--189.

Digital Library

[15]

Mandow, L., and Pérez de la Cruz, J. L. 2009. A memory-efficient search strategy for multiobjective shortest path problems. In KI'2009: Advances in Artificial Intelligence. Lecture Notes in Artificial Intelligence, vol. 5803. Springer-Verlag, Berlin, Germany, 25--32.

Digital Library

[16]

Mérõ, L. 1984. A heuristic search algorithm with modifiable estimate. Artif. Intell. 23, 1, 13--27.

Digital Library

[17]

Pearl, J. 1984. Heuristics. Addison-Wesley, Reading, MA.

[18]

Perny, P., and Spanjaard, O. 2002. On preference-based search in state space graphs. In Proceedings of the 18th National Conference on Artificial Intelligence. AAAI Press, 751--756.

Digital Library

[19]

Perny, P., and Spanjaard, O. 2005. A preference-based approach to spanning trees and shortest paths problems. Europ. J. Operat. Res. 162, 584--601.

[20]

Refanidis, I., and Vlahavas, I. 2003. Multiobjective heuristic state-space search. Artif. Intell. 145, 1--32.

Digital Library

[21]

Stewart, B. S., and White, C. C. 1991. Multiobjective A^&ast;. J. ACM 38, 4, 775--814.

Digital Library

Cited By

Ren ZHernández CLikhachev MFelner AKoenig SSalzman ORathinam SChoset H(2025)EMOA*Artificial Intelligence10.1016/j.artint.2024.104260339:COnline publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1016/j.artint.2024.104260
Wang YLi XMa SLi YJia QLi YWu ZFeng Q(2025)Proactive Bi-objective Multi-path Planning for Wireless Sensor NetworksComputing and Combinatorics10.1007/978-981-96-1093-8_20(238-251)Online publication date: 20-Feb-2025
https://doi.org/10.1007/978-981-96-1093-8_20
Skyler SShperberg SAtzmon DFelner ASalzman OChan SZhang HKeonig SYeoh WUlloa CLarson K(2024)Theoretical study on multi-objective heuristic searchProceedings of the Thirty-Third International Joint Conference on Artificial Intelligence10.24963/ijcai.2024/776(7021-7028)Online publication date: 3-Aug-2024
https://dl.acm.org/doi/10.24963/ijcai.2024/776
Show More Cited By

Index Terms

Multiobjective A^* search with consistent heuristics
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Discrete space search
      2. Game tree search

Recommendations

Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

In this paper, a greedy heuristic and two local search algorithms, 1-opt local search and k-opt local search, are proposed for the unconstrained binary quadratic programming problem (BQP). These heuristics are well suited for the incorporation into meta-...
Improved Tabu search heuristics for the dynamic space allocation problem

The dynamic space allocation problem (DSAP) presented in this paper considers the task of assigning items (resources) to locations during a multi-period planning horizon such that the cost of rearranging the items is minimized. Three tabu search ...
Grammatical Evolution of Local Search Heuristics

Genetic programming approaches have been employed in the literature to automatically design constructive heuristics for cutting and packing problems. These heuristics obtain results superior to human-created constructive heuristics, but they do not ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 57, Issue 5

June 2010

126 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/1754399

Issue’s Table of Contents

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Accepted: 01 February 2010

Revised: 01 February 2010

Published: 25 June 2008

Received: 01 March 2006

Published in JACM Volume 57, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Junta de Andalucía (España)

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

76
Total Citations
View Citations
1,826
Total Downloads

Downloads (Last 12 months)87
Downloads (Last 6 weeks)18

Reflects downloads up to 19 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ren ZHernández CLikhachev MFelner AKoenig SSalzman ORathinam SChoset H(2025)EMOA*Artificial Intelligence10.1016/j.artint.2024.104260339:COnline publication date: 1-Feb-2025
https://dl.acm.org/doi/10.1016/j.artint.2024.104260
Wang YLi XMa SLi YJia QLi YWu ZFeng Q(2025)Proactive Bi-objective Multi-path Planning for Wireless Sensor NetworksComputing and Combinatorics10.1007/978-981-96-1093-8_20(238-251)Online publication date: 20-Feb-2025
https://doi.org/10.1007/978-981-96-1093-8_20
Skyler SShperberg SAtzmon DFelner ASalzman OChan SZhang HKeonig SYeoh WUlloa CLarson K(2024)Theoretical study on multi-objective heuristic searchProceedings of the Thirty-Third International Joint Conference on Artificial Intelligence10.24963/ijcai.2024/776(7021-7028)Online publication date: 3-Aug-2024
https://dl.acm.org/doi/10.24963/ijcai.2024/776
Ba BYu YWang RGotteland JGao Y(2024) A New Multiobjective A ∗ Algorithm With Time Window Applied to Large Airports Journal of Advanced Transportation10.1155/atr/75362172024:1Online publication date: 26-Nov-2024
https://doi.org/10.1155/atr/7536217
Wu BChen ZLu XXiao B(2024)A hierarchical model with hexagon grids for multi-objective route planning in large-scale off-road environmentsInternational Journal of Geographical Information Science10.1080/13658816.2024.234731938:7(1388-1413)Online publication date: 6-May-2024
https://doi.org/10.1080/13658816.2024.2347319
da Silva JRamos GBarbosa J(2023)Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and ProspectsAlgorithms10.3390/a1603016216:3(162)Online publication date: 16-Mar-2023
https://doi.org/10.3390/a16030162
Hernández CYeoh WBaier JFelner ASalzman OZhang HChan SKoenig SElkind E(2023)Multi-objective search via lazy and efficient dominance checksProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/850(7223-7230)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/850
Salzman OFelner AHernandez CZhang HChan SKoenig SElkind E(2023)Heuristic-search approaches for the multi-objective shortest-path problemProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/757(6759-6768)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/757
Chen DTrevizan FThiébaux SWilliams BChen YNeville J(2023)Heuristic search for multi-objective probabilistic planningProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i10.26409(11945-11954)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i10.26409
Khanda AShovan SDas S(2023)A Parallel Algorithm for Updating a Multi-objective Shortest Path in Large Dynamic NetworksProceedings of the SC '23 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis10.1145/3624062.3625134(739-746)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3624062.3625134
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents