Computing possibly optimal solutions for multi-objective constraint optimisation with tradeoffs

Thumbnail Image
Files
ijcai2015-moopt-po.pdf(493.5 KB)
Accepted version
Date
2015-07
Authors
Wilson, Nic
Razak, Abdul
Marinescu, Radu
Journal Title
Journal ISSN
Volume Title
Publisher
AAAI Press / International Joint Conferences on Artificial Intelligence
Published Version
Research Projects
Organizational Units
Journal Issue
Abstract
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.
Description
Keywords
Constraint optimisation problem , AI technology , Artificial intelligence (AI) , Information systems
Citation
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
Link to publisher’s version
https://www.ijcai.org/Proceedings/2015
URI
https://hdl.handle.net/10468/10797
Collections
Computer Science - Conference Items
Insight Centre for Data Analytics - Conference Items
Copyright
© 2015 International Joint Conferences on Artificial Intelligence.