Evolving Variable-Ordering Heuristics for Constrained Optimisation
نویسندگان
چکیده
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach offers two significant advantages over existing methods: it allows the evolution of more complex combinations of heuristics, and; it can identify fruitful synergies among heuristics. Using four different classes of MAX-SAT problems, we experimentally demonstrate that algorithms evolved with this method exhibit superior performance in comparison to general purpose methods.
منابع مشابه
Repeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملAdversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of opponents, we can model both collaborative problem solving, where intelligent participants with different agendas must work together to solve a problem, and multi-criteria optimisation, where one decision maker must balance...
متن کاملHeuristics Guided by the Quality of solutions in Weighted CSP
Weighted Constraint Satisfaction Problems (WCSP) are used to model and to solve some constraint optimization problems. WCSPs are often solved by complete or partial tree search strategies combined with filtering. For these methods, variable ordering heuristic (MinDom/FutDeg) and value ordering heuristic (MinAC) are considered to be the most efficient ones. In this paper, we propose a new value ...
متن کاملAn Examination of Probabilistic Value-Ordering Heuristics
Searching for solutions to constraint satisfaction problems (CSPs) is NP-hard in general. Heuristics for variable and value ordering have proven useful in guiding the search towards more fruitful areas of the search space and hence reducing the amount of time spent searching for solutions. Static ordering methods impart an ordering in advance of the search and dynamic ordering methods use infor...
متن کاملResource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)
Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...
متن کامل