Advertisement
Published in:
2008 | OriginalPaper | Chapter
On the Hybridization of Constraint Programming and Local Search Techniques: Models and Software Tools
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Resource management problems are generally modeled as Constraint Satisfaction / Optimization Problems (CSPs or COPs). The solution methods for CSPs and COPs can be split into:
complete methods
, which systematically explore the whole solution space;
incomplete methods
, which rely on heuristics and focus on interesting areas of the solution space. Our focus is manly in Constrain Programming (CP) and Local Search (LS) techniques.
CP languages
are usually based on complete methods that analyze the search space alternating constraint propagation phases and variable assignment phases. Their main advantage is
flexibility
.
LS methods
, instead, rely on the definition of “proximity” and explore only specific areas of the search space. Their main advantage is
efficiency
.