Abstract
This paper present a Non-dominated Sorting based Multi Objective A * Search (NSMOA *) algorithm for multi-objective search problem. It is an extension of the New Approach for Multi Objective A * Search (NAMOA *). This study aims to improve the selection phase of the NAMOA * algorithm which can affect the performance of the algorithm considerably, especially when the number of non-dominated solutions increases to a large number during the search. This research proposes a new sorting method that allows selection and expansion of the partial solutions be carried out more efficiently. The results demonstrate that our algorithm expands fewer nodes and explores a smaller region of solution space using the same heuristic.
This is a preview of subscription content, log in via an institution to check access.
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
Dasgupta, P., Chakrabarti, P., Desarkar, S.: Utility of pathmax in partial order heuristic search. Information Processing Letters 55(6), 317–322 (1995)
Dasgupta, P., Chakrabarti, P., Desarkar, S.: Multiobjective heuristic search: An introduction to intelligent search methods for multicriteria optimization. Springer (1999)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische mathematik 1(1), 269–271 (1959)
Hansen, P.: Bicriterion path problems. In: LNEMS, vol. 177, pp. 109–127. Springer (1979)
Hart, P., Nilsson, N., Raphel, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)
Loui, R.P.: Optimal paths in graphs with stochastic or multidimensional weights. Communications of the ACM 26(9), 670–676 (1983)
Deb, K., Agrawal, S., Pratab, A., Meyarivan, T.: A fast elitist nondominated sorting genetic algorithm for multiobjective optimization: NSGA-II. In: Proc. Parallel Problem Solving from Nature VI Conference, pp. 849–858 (2000)
Mandow, L., Pérez, J.L.: A new approach to multiobjective A* search. In: Proceedings of the XIX International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 218–223 (2005)
Mandow, L., Péerez, J.L.: Multiobjective A* Search with Consistent Heuristics. Journal of the ACM 57(5), Article 27 (2010)
Perny, P., Spanjaard, O.: On preference-based search in state space graphs. In: Proceedings of the 18th National Conference on Artificial Intelligence, pp. 751–756. AAAI Press (2002)
Perny, P., Spanjaard, O.: A preference-based approach to spanning trees and shortest paths problems. European Journal of Operational Research 162(3), 584–601 (2005)
Milettinen, K.: Nonlinear Multiobjective Optimization. Springer (1999)
Hwang, C., Masud, A.: Multiple objective decision making, methods and applications: a state-of-the-art survey. Springer (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Haqqani, M., Li, X., Yu, X. (2014). A Multi-Objective A* Search Based on Non-dominated Sorting. In: Dick, G., et al. Simulated Evolution and Learning. SEAL 2014. Lecture Notes in Computer Science, vol 8886. Springer, Cham. https://doi.org/10.1007/978-3-319-13563-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-13563-2_20
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13562-5
Online ISBN: 978-3-319-13563-2
eBook Packages: Computer ScienceComputer Science (R0)