Online Control of Enumeration Strategies via Bat-Inspired Optimization

Constraint programming allows to solve constraint satisfaction and optimization problems by building and then exploring a search tree of potential solutions. Potential solutions are generated by firstly selecting a variable and then a value from the given problem. The enumeration strategy is responsible for selecting the order in which those variables and values are selected to produce a potential solution. 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. A modern idea to handle this concern, is to interleave during solving time a set of different strategies instead of using a single one. 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 a new system for online control of enumeration strategies based on bat-inspired optimization. The bat algorithm is a relatively modern metaheuristic based on the location behavior of bats that employ echoes to identify the objects in their surrounding area. We illustrate, promising results where the proposed bat algorithm is able to outperform previously reported metaheuristic-based approaches for online control of enumeration strategies.

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

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

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

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

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

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

[7]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[8]  Broderick CRAWFORD,et al.  Dynamic selection of enumeration strategies for solving constraint satisfaction problems , 2012 .

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

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

[11]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[12]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

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

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

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

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

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

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

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