Best-first vs. depth-first AND/OR search for multi-objective constraint optimization

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 1, Issue , 2010, Pages 439-446

  Marinescu, Radu ^a  

^a Smarter Cities Technology Centre   (Ireland)

Author keywords

AND OR search spaces; Decomposition; Multi objective constraint optimization; Search

Indexed keywords

BEST FIRST SEARCH; BRANCH AND BOUNDS; CONSTRAINT OPTIMIZATIONS; DEPTH FIRST; HEURISTIC FUNCTIONS; LINEAR SPACES; MULTI OBJECTIVE; PROBLEM STRUCTURE; REAL-WORLD; SEARCH; SEARCH SPACES; SEARCH TREES; TIME SAVINGS;

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; TREES (MATHEMATICS);

MULTIOBJECTIVE OPTIMIZATION;

EID: 78751484434     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2010.69     Document Type: Conference Paper

References (17)

1. R. Dechter and R. Mateescu, "AND/OR search spaces for graphical models," Artificial Intelligence, vol. 171, no. 2-3, pp. 73-106, 2007.
2. R. Marinescu, "Exploiting problem decomposition in multi-objective constraint optimization," in International Conference on Principles and Practice of Constraint Programming (CP), 2009, pp. 592-607.
3. E. Rollon and J. Larrosa, "Bucket elimination for multi-objective optimization problems," Journal of Heuristics, vol. 12, pp. 307-328, 2006.
4. E. C. Freuder and M. J. Quinn, "Taking advantage of stable sets of variables in constraint satisfaction problems," in International Joint Conference on Artificial Intelligence (IJCAI), 1985, pp. 1076-1078.
5. R. Bayardo and D. P. Miranker, "On the space-time trade-off in solving constraint satisfaction problems," in International Joint Conference on Artificial Intelligence (IJCAI), 1995, pp. 558-562.
6. R. Marinescu and R. Dechter, "Memory intensive AND/OR search for combinatorial optimization in graphical models," Artificial Intelligence, vol. 173, no. 16-17, pp. 1492-1524, 2009.
7. -, "Evaluating the impact of AND/OR search on 0-1 integer linear programming," Constraints, vol. 15, no. 1, pp. 29-63, 2010.
8. P. Dasgupta, P. Chakrabarti, and S. DeSarkar, "Multiobjective heuristic search in AND/OR graphs," Journal of Algorithms, vol. 20, pp. 282-311, 1996.
9. N. J. Nilsson, Principles of Artificial Intelligence. Tioga, Palo Alto, CA, 1980.
10. E. Rollon and J. Larrosa, "Multi-objective Russian doll search," in AAAI Conference on Artificial Intelligence (AAAI), 2007, pp. 249-254.
11. E. Bensana, M. Lemaitre, and G. Verfaillie, "Earth observation satellite management." Constraints, vol. 4, no. 3, pp. 293-299, 1999.
12. R. Korf, "Linear-space best-first search," Artificial Intelligence, vol. 62, pp. 41-78, 1993.
13. R. Loui, "Optimal paths in graphs with stochastic or multi-dimensional weights," Communications of the ACM, vol. 26, no. 9, pp. 670-676, 1983.
14. B. Stewart and C. White, "Multiobjective A*," Journal of ACM, vol. 38, no. 4, pp. 775-814, 1991.
15. L. Mandow and J. P. de la Cruz, "A new approach to multiobjective A* search," in International Joint Conference on Artificial Intelligence (IJCAI), 2005, pp. 218-223.
16. C. White, B. Stewart, and R. Carraway, "Multiobjective, preference-based search in acyclic OR-graphs," European Journal of Operational Research, vol. 56, no. 1, pp. 357-363, 1992.
17. C. Liaw, B. Stewart, and C. White, "Multiobjective heuristic search in AND/OR graphs," IEEE Transactions on Systems, Man and Cybernetics, vol. 25, no. 11, pp. 1513-1521, 1995.