Automatic streamlining for constrained optimisation
Abstract
Augmenting a base constraint model with additional constraints can strengthen the inferences made by a solver and therefore reduce search effort. We focus on the automatic addition of streamliner constraints, which trade completeness for potentially very significant reduction in search. Recently an automated approach has been proposed, which produces streamliners via a set of streamliner generation rules. This existing automated approach to streamliner generation has two key limitations. First, it outputs a single streamlined model. Second, the approach is limited to satisfaction problems. We remove both limitations by providing a method to produce automatically a portfolio of streamliners, each representing a different balance between three criteria: how aggressively the search space is reduced, the proportion of training instances for which the streamliner admitted at least one solution, and the average reduction in quality of the objective value versus the unstreamlined model. In support of our new method, we present an automated approach to training and test instance generation, and provide several approaches to the selection and application of the streamliners from the portfolio. Empirical results demonstrate drastic improvements both to the time required to find good solutions early and to prove optimality on three problem classes.
Citation
Spracklen , P , Dang , N , Akgun , O & Miguel , I J 2019 , Automatic streamlining for constrained optimisation . in T Schiex & S de Givry (eds) , Principles and Practice of Constraint Programming : 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 11802 LNCS , Springer , Cham , pp. 366-383 , 25th International Conference on Principles and Practice of Constraint Programming (CP 2019) , Stamford , Connecticut , United States , 30/09/19 . https://doi.org/10.1007/978-3-030-30048-7_22 conference
Publication
Principles and Practice of Constraint Programming
ISSN
0302-9743Type
Conference item
Description
Funding: UK EPSRC grant EP/P015638/1.Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Related items
Showing items related by title, author, creator and subject.
-
Virtual Worlds and the 3D Web – time for convergence?
Bakri, Hussein; Allison, Colin; Miller, Alan Henry David; Oliver, Iain Angus (Springer, 2016) - Conference itemMulti-User Virtual Worlds (MUVW) such as Open Wonderland and OpenSim have proved to be fruitful platforms for innovative educational practice, supporting exploratory learning and generating true engagement. However, when ... -
Studying programmer behaviour at scale : a case study using Amazon Mechanical Turk
Jacques, Jason T.; Kristensson, Per Ola (ACM, 2021-03-22) - Conference itemDeveloping and maintaining a correct and consistent model of how code will be executed is an ongoing challenge for software developers. However, validating the tools and techniques we develop to aid programmers can be a ... -
Investigating the accessibility of crowdwork tasks on Mechanical Turk
Uzor, Stephen; Jacques, Jason T.; Dudley, John J.; Kristensson, Per Ola (ACM, 2021-05-06) - Conference itemCrowdwork can enable invaluable opportunities for people with disabilities, not least the work fexibility and the ability to work from home, especially during the current Covid-19 pandemic. This paper investigates how ...