Exploiting Problem Decomposition in Multi-objective Constraint Optimization

Multi-objective optimization is concerned with problems involving multiple Measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-and-Bound (AOBB). a well known search algorithm, from mono-objective to multi-objective optimization. The new algorithm MO-AOBB exploits efficiently the problem structure by traversing an AND/OR search tree and uses static and dynamic mini-bucket heuristics to guide the search. We show that MO-AOBB improves dramatically over the traditional OR search approach, on various benchmarks for multi-objective optimization.