Online control of enumeration strategies via bat algorithm and black hole optimization

Constraint programming is an efficient and powerful paradigm for solving constraint satisfaction and optimization problems. Under this paradigm, problems are modeled as a sequence of variables and a set of constraints. The variables have a non-empty domain of candidate values and constraints restrict the values that variables can adopt. The solving process operates by assigning values to variables in order to produce potential solutions which are then evaluated. A main component in this process is the enumeration strategy, which decides the order in which variables and values are chosen to produce such potential solutions. There exist different ways to perform this selection, and depending on the quality of this decision, the efficiency of the solving process may dramatically vary. Unfortunately, selecting the proper strategy is known to be a hard task, as its behavior during search is generally unpredictable and certainly depends on the problem at hand. A recent trend to handle this concern, is to interleave a set of different strategies instead of using a single one during the whole process. The strategies are evaluated according to process indicators in order to use the most promising one on each part of the search process. This process is known as online control of enumeration strategies and its correct configuration can be seen itself as an optimization problem. In this paper, we present two new systems for online control of enumeration strategies based on recent nature-inspired metaheuristics: bat algorithm and black hole optimization. The bat algorithm mimics the location capabilities of bats that employ echoes to identify the objects in their surrounding areas, while black hole optimization inspires its behavior on the gravitational pull of black holes in space. We perform different experimental results by using different enumeration strategies and well-known benchmarks, where the proposed approaches are able to noticeably outperform previous work on online control.

[1]  Broderick Crawford,et al.  A framework for autonomous search in the Eclipsesolver , 2011, IEA/AIE'11.

[2]  Xin-She Yang,et al.  Bat algorithm: literature review and applications , 2013, Int. J. Bio Inspired Comput..

[3]  Philippe Refalo,et al.  Impact-Based Search Strategies for Constraint Programming , 2004, CP.

[4]  Broderick Crawford,et al.  An extensible autonomous search framework for constraint programming , 2011 .

[5]  Carlos Castro,et al.  An Approach for Dynamic Split Strategies in Constraint Solving , 2005, MICAI.

[6]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[7]  Broderick Crawford,et al.  Adaptive filtering strategy for numerical constraint satisfaction problems , 2015, Expert Syst. Appl..

[8]  Xin-She Yang,et al.  Bat algorithm for multi-objective optimisation , 2011, Int. J. Bio Inspired Comput..

[9]  Richard J. Wallace,et al.  Experimental studies of variable selection strategies based on constraint weights , 2008, J. Algorithms.

[10]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[11]  Abdolreza Hatamlou,et al.  Black hole: A new heuristic optimization approach for data clustering , 2013, Inf. Sci..

[12]  Laurent Granvilliers,et al.  Search heuristics for constraint-aided embodiment design , 2009, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[13]  H. Lilliefors.  On the Kolmogorov-Smirnov Test for Normality with Mean and Variance Unknown , 1967 .

[14]  Frédéric Saubion,et al.  A Compass to Guide Genetic Algorithms , 2008, PPSN.

[15]  Richard J. Wallace,et al.  Learning to Identify Global Bottlenecks in Constraint Satisfaction Search , 2007, FLAIRS.

[16]  Broderick Crawford,et al.  Online Control of Enumeration Strategies via Bat-Inspired Optimization , 2015, IWINAC.

[17]  Patrick Sebastian,et al.  Search Heuristics for Constraints-Aided Design , 2009 .

[18]  Eric Monfroy,et al.  Autonomous Search , 2012, Springer Berlin Heidelberg.

[19]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[20]  Broderick Crawford,et al.  WSM Tuning in Autonomous Search via Gravitational Search Algorithms , 2015, CSOC.

[21]  Broderick Crawford,et al.  Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization , 2013, Expert Syst. Appl..

[22]  Susan L. Epstein,et al.  Learning to Solve Constraint Problems , 2007 .

[23]  Roman Barták,et al.  Limited assignments: a new cutoff strategy for incomplete depth-first search , 2005, SAC '05.

[24]  Patrice Boizumault,et al.  Solving Nurse Rostering Problems Using Soft Global Constraints , 2009, CP.

[25]  Philippe Baptiste,et al.  Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems , 1997, Constraints.

[26]  Sanjay Kumar Singh,et al.  Black Hole Algorithm and Its Applications , 2015, Computational Intelligence Applications in Modeling and Control.

[27]  Susan L. Epstein,et al.  The Adaptive Constraint Engine , 2002, CP.

[28]  Pedro Barahona,et al.  Constraint Programming in Structural Bioinformatics , 2007, Constraints.

[29]  Orlando Durán,et al.  Cell formation in group technology using constraint programming and Boolean satisfiability , 2012, Expert Syst. Appl..

[30]  Broderick Crawford,et al.  A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction , 2011, IWINAC.

[31]  H. B. Mann,et al.  On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other , 1947 .

[32]  David H. Stern,et al.  Learning Adaptation to Solve Constraint Satisfaction Problems , 2009 .

[33]  Holger H. Hoos,et al.  Automated Algorithm Configuration and Parameter Tuning , 2012, Autonomous Search.

[34]  Xin-She Yang,et al.  A framework for self-tuning optimization algorithm , 2013, Neural Computing and Applications.

[35]  Li Cheng,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010 .

[36]  Philippe Baptiste,et al.  Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems , 1997, CP.