Book Chapter10.1007/978-3-642-22098-2_112
Extensible CP-based autonomous search
Broderick Crawford,Ricardo Soto,Carlos Castro,Eric Monfroy +3 more
- 09 Jul 2011
- pp 561-565
TL;DR: A preliminary architecture for performing Autonomous Search in CP to perform an “on the fly” replacement of bad-performing heuristics by more promising ones and its extensibility makes it possible to easily upgrade their components in order to improve the AS mechanism.
read more
Abstract: A main concern in Constraint Programming (CP) is to determine good variable and value order heuristics. However, this is known to be quite difficult as the effects on the solving process are rarely predictable. A novel solution to handle this concern is called Autonomous Search (AS), which is a special feature allowing an automatic reconfiguration of the solving process when a poor performance is detected. In this paper, we present a preliminary architecture for performing AS in CP. The idea is to perform an “on the fly” replacement of bad-performing heuristics by more promising ones. Another interesting feature of this architecture is its extensibility. It is possible to easily upgrade their components in order to improve the AS mechanism.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Parameter tuning of a choice-function based hyperheuristic using Particle Swarm Optimization
TL;DR: This paper explores 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.
89
A Max-Min Ant System algorithm to solve the Software Project Scheduling Problem
Broderick Crawford,Ricardo Soto,Ricardo Soto,Franklin Johnson,Franklin Johnson,Eric Monfroy,Fernando Paredes +6 more
TL;DR: This work presents the design of a Max-Min Ant System algorithm using the Hyper-Cube framework to solve the Software Project Scheduling Problem, and shows the feasibility and robustness of the approach, while reaching competitive solutions.
46
Using autonomous search for generating good enumeration strategy blends in constraint programming
Ricardo Soto,Broderick Crawford,Eric Monfroy,Víctor Bustos +3 more
- 18 Jun 2012
TL;DR: The preliminary goal is to find good enumeration strategy blends for a given Constraint Satisfaction Problem by carefully tracking the resolution of Autonomous search.
31
A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems
TL;DR: This paper presents a new cuckoo search algorithm for solving Sudoku puzzles combining prefiltering phases and geometric operations, and illustrates encouraging experimental results where this approach noticeably competes with the best approximate methods reported in the literature.
Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem
Broderick Crawford,Ricardo Soto,Rodrigo Cuesta,Fernando Paredes +3 more
- 22 Jun 2014
TL;DR: 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.
References
What Is Autonomous Search
Youssef Hamadi,Youssef Hamadi,Eric Monfroy,Frédéric Saubion +3 more
- 01 Jan 2011
TL;DR: A general definition and a taxonomy of search processes with respect to their computation characteristics are proposed and some computation rules between computation stages are used to formalize the solver modifications and adaptations.
49
Adaptive enumeration strategies and metabacktracks for constraint solving
TL;DR: This paper design and evaluate strategies to improve resolution performances of a set of problems, and experimental results show the effectiveness of the approach.
28
•Book
Special Issue on Autonomous Search
Youssef Hamadi,Youssef Hamadi,Eric Monfroy,Frédéric Saubion +3 more
- 01 Jan 2009
13
Autonomous Control Approach for Local Search
TL;DR: An approach for the autonomous control of a local search algorithm, which has several moves operators, whose efficiency can be diverse and whose application is adjusted according to the observation of the current status of search, in order to adapt to the balance between exploitation and exploration of search space.
5
A Hyperheuristic Approach to Select Enumeration Strategies in Constraint Programming
Broderick Crawford,Mauricio Montecinos,Carlos Castro,Eric Monfroy +3 more
- 28 Dec 2009
TL;DR: In this article, a hyperheuristic approach using information about the search process is presented to select the enumeration stretegies dynamically, which outperforms the use of individual strategies.
2