A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving

  title={A Hyperheuristic Approach for Guiding Enumeration in Constraint Solving},
  author={Broderick Crawford and Carlos Castro and {\'E}ric Monfroy and Ricardo Soto and Wenceslao Palma and Fernando Paredes},
In this paper we design and evaluate a dynamic selection mechanism of enumeration strategies based on the information of the solving process. Unlike previous research works we focus in reacting on the fly, allowing an early replacement of bad-performance strategies without waiting the entire solution process or an exhaustive analysis of a given class of problems. Our approach uses a hyperheuristic approach that operates at a higher level of abstraction than the Constraint Satisfaction Problems… 
Adaptive and Multilevel Approach for Constraint Solving
The main novelty of this approach is that it reconfigure the search based solely on performance data gathered while solving the current problem, and uses an upper-level metaheuristic to determine the best set of parameters of the choice function.
Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem
This work presents a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem and shows that the algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set cover problem.
Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem
A novel application of the Artificial Bee Colony algorithm to solve the Weighted Set Covering Problem and shows that the algorithm is competitive in terms of solution quality with other recent metaheuristic approaches.
Two swarm intelligence algorithms for the Set Covering Problem
The Weighted Set Covering problem is a formal model for many industrial optimization problems and its resolution is presented with two novel metaheuristics: Firefly Algorithm and Artificial Bee Colony Algorithm.
Self-adaptive Systems: Facilitating the Use of Combinatorial Problem Solvers
The main goal of this paper is to review recent works on this kind of Self-adaptive Systems from the standpoint of the actual requirement for solvers.
An Artificial Bee Colony Algorithm for the Set Covering Problem
Computational results show that Artificial Bee Colony algorithm is competitive in terms of solution quality with other metaheuristic approaches for the Set Covering Problem problem.
Automatic Triggering of Constraint Propagation
A hybrid solver based on a Branch and Bound algorithm combined with constraint propagation to reduce the search space is presented and the results show that it is possible to make reasonable use of constraint propagation.
Nurse Rostering with Soft Constraints - Evidence from Chilean Mid-size Health Care Centers
This paper presents a new model involving hard and soft constraints that can be applied generically to any chilean health care center and devoted to a set of mid-size Chilean hospitals that use a very uncommon shift pattern due to proper country legal regulations.


A Hyperheuristic Approach to Scheduling a Sales Summit
The behaviour of several different hyperheuristic approaches for a real-world personnel scheduling problem is analysed and the effectiveness of this approach is shown and wider applicability of hyper heuristic approaches to other problems of scheduling and combinatorial optimisation is suggested.
Using a Choice Function for Guiding Enumeration in Constraint Solving
A Choice Function for guiding enumeration is proposed, which provides guidance to the solver by indicating which enumeration strategy should be applied next based upon the information of the search process.
Practice and Theory of Automated Timetabling III
A multiobjective genetic algorithm was proposed for this timetabling problem, incorporating two distinct objectives that concern precisely the minimization of the violations of both types of constraints, hard and soft, while respecting the two competing aspects of teachers and classes.
Adaptive Constraint Satisfaction: The Quickest First Principle
This report describes one such adaptive algorithm, based on the principle of chaining, designed to avoid the phenomenon of exceptionally hard problem instances and shows how the speed of more naive algorithms can be utilised safe in the knowledge that the exceptional behaviour can be bounded.
Adaptive Enumeration Strategies and Metabacktracks for Constraint Solving
This paper design and evaluate strategies to improve resolution performances of a set of problems, and experimental results show the effectiveness of the approach.
Metaheuristics - From Design to Implementation
This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
Autonomous Search
This is the first book dedicated to autonomous search, and it can be used as a reference for researchers, engineers, and postgraduates in the areas of constraint programming, machine learning, evolutionary computing, and feedback control theory.
An Approach for Dynamic Split Strategies in Constraint Solving
This work proposes to dynamically change strategies showing bad performances when this is not enough to improve resolution, and introduces some meta-backtracks to get good performances without the knowledge of experts.