Computing possibly optimal solutions for multi-objective constraint optimisation with tradeoffs
AAAI Press / International Joint Conferences on Artificial Intelligence
Computing the set of optimal solutions for a multiobjective constraint optimisation problem can be computationally very challenging. Also, when solutions are only partially ordered, there can be a number of different natural notions of optimality, one of the most important being the notion of Possibly Optimal, i.e., optimal in at least one scenario compatible with the inter-objective tradeoffs. We develop an AND/OR Branch-and-Bound algorithm for computing the set of Possibly Optimal solutions, and compare variants of the algorithm experimentally.
Constraint optimisation problem , AI technology , Artificial intelligence (AI) , Information systems
Wilson, N., Razak, A. and Marinescu, R. (2015) 'Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs', IJCAI'15: Proceedings of the 24th International Conference on Artificial Intelligence, Buenos Aires, Argentina, 25–31 July, pp. 815–821. isbn: 978-1-57735-738-4
© 2015 International Joint Conferences on Artificial Intelligence.