Automatic streamlining for constrained optimisation
MetadataShow full item record
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.
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 , United States , 30/09/19 . https://doi.org/10.1007/978-3-030-30048-7_22conference
Principles and Practice of Constraint Programming
Copyright © 2019 Springer Nature Switzerland AG. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1007/978-3-030-30048-7_22
DescriptionFunding: UK EPSRC grant EP/P015638/1.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Showing items related by title, author, creator and subject.
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 ...
Stevenson, Graeme Turnbull; Ye, Juan; Dobson, Simon Andrew; Nixon, Paddy (2010) - Journal articleLocation is a core concept in most pervasive systems-and one that's surprisingly hard to deal with flexibly. Using a location model supporting a range of expressive representations for spaces, spatial relationships, and ...
The effect of visual and interactive representations on human performance and preference with scalar data fields Han, Han L.; Nacenta, Miguel A. (Canadian Human-Computer Communications Society / Société canadienne du dialogue humain-machine, 2020-05-28) - Conference item2D scalar data fields are often represented as heatmaps because color can help viewers perceive structure without having to interpret individual digits. Although heatmaps and color mapping have received much research ...