Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization

A Constraint Satisfaction Problem is defined by a set of variables and a set of constraints, each variable has a nonempty domain of possible values. Each constraint involves some subset of the variables and specifies the allowable combinations of values for that subset. A solution of the problem is defined by an assignment of values to some or all of the variables that does not violate any constraints. To solve an instance, a search tree is created and each node in the tree represents a variable of the instance. The order in which the variables are selected for instantiation changes the form of the search tree and affects the cost of finding a solution. In this paper we explore the use of a Choice Function to dynamically select from a set of variable ordering heuristics the one that best matches the current problem state in order to show an acceptable performance over a wide range of instances. The Choice Function is defined as a weighted sum of process indicators expressing the recent improvement produced by the heuristic recently used. The weights are determined by a Particle Swarm Optimization algorithm in a multilevel approach. We report results where our combination of strategies outperforms the use of individual strategies.

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

[2]  Dilip Kumar Pratihar,et al.  Tuning of neural networks using particle swarm optimization to model MIG welding process , 2011, Swarm Evol. Comput..

[3]  Ajith Abraham,et al.  A new quantum behaved particle swarm optimization , 2008, GECCO '08.

[4]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

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

[6]  Paolo Liberatore,et al.  On the complexity of choosing the branching literal in DPLL , 2000, Artif. Intell..

[7]  Eric Monfroy,et al.  From parameter control to search control: Parameter Control Abstraction in Evolutionary Algorithms , 2008 .

[8]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[9]  Christian Bessiere,et al.  Measuring Search Trees , 2004 .

[10]  Mark S. Fox,et al.  Variable and Value Ordering Heuristics for the Job Shop Constraint Satisfaction Problem , 1995 .

[11]  Paula Sturdy,et al.  Learning Good Variable Orderings , 2003, CP.

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

[13]  J. Christopher Beck,et al.  Toward Understanding Variable Ordering Heuristics for Constraint Satisfaction Problems , 2003 .

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

[15]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[16]  Frédéric Saubion,et al.  Special Issue on Autonomous Search , 2009 .

[17]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

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

[19]  Broderick Crawford,et al.  Extensible CP-Based Autonomous Search , 2011, HCI.