Lawrence Mandow
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.
- Alechina, N., and Logan, B. 2001. State space search with prioritised soft constraints. Appl. Intell. 14, 3, 263--278. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- Dasgupta, P., Chakrabarti, P., and DeSarkar, S. 1995. Utility of pathmax in partial order heuristic search. Inf. Proc. Lett. 55, 317--322. Google ScholarDigital Library
- Dasgupta, P., Chakrabarti, P., and DeSarkar, S. 1999. Multiobjective Heuristic Search. Vieweg, Braunschweig/Wiesbaden.Google Scholar
- Dechter, R., and Pearl, J. 1985. Generalized best-first search strategies and the optimality of A*. J. ACM 32, 3 (July), 505--536. Google ScholarDigital Library
- Dijkstra, E. W. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 269--271.Google ScholarDigital Library
- 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.Google ScholarCross Ref
- Hansen, P. 1979. Bicriterion path problems. In LNEMS 177. Springer, 109--127.Google Scholar
- 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.Google ScholarCross Ref
- Loui, R. P. 1983. Optimal paths in graphs with stochastic or multidimensional weights. Comm. ACM 26, 9 (Sept.), 670--676. Google ScholarDigital Library
- Mahanti, A., and Ray, K. 1988. Network search algorithms with modifiable heuristics. In Search in Artificial Intelligence. Springer-Verlag, Berlin, Germany, 200--222. Google ScholarDigital Library
- Mandow, L., and Pérez de la Cruz, J. L. 2003. Multicriteria heuristic search. Europ. J. Operat. Res. 150, 253--280.Google ScholarCross Ref
- Mandow, L., and Pérez de la Cruz, J. L. 2005. A new approach to multiobjective A* search. In Proceedings of the XIX International Joint Conference on Artificial Intelligence (IJCAI'05). 218--223. Google ScholarDigital Library
- Mandow, L., and Pérez de la Cruz, J. L. 2006. Comparison of heuristics in multiobjective A* search. In CAEPIA'05. Lecture Notes in Artificial Intelligence, vol. 4177. Springer-Verlag, Berlin, Germany, 180--189. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Mérõ, L. 1984. A heuristic search algorithm with modifiable estimate. Artif. Intell. 23, 1, 13--27. Google ScholarDigital Library
- Pearl, J. 1984. Heuristics. Addison-Wesley, Reading, MA.Google Scholar
- 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. Google ScholarDigital Library
- Perny, P., and Spanjaard, O. 2005. A preference-based approach to spanning trees and shortest paths problems. Europ. J. Operat. Res. 162, 584--601.Google ScholarCross Ref
- Refanidis, I., and Vlahavas, I. 2003. Multiobjective heuristic state-space search. Artif. Intell. 145, 1--32. Google ScholarDigital Library
- Stewart, B. S., and White, C. C. 1991. Multiobjective A*. J. ACM 38, 4, 775--814. Google ScholarDigital Library
Index Terms
- Multiobjective A* search with consistent heuristics
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