Adaptive Search is a generic, domain-independent constraint-based Local Search method.
This metaheuristic takes advantage of the structure of the problem in terms of constraints and variables in order to guide the search.

The input of the method is a CSP, defined as a triple (X;D;C), where X is a set of variables, D is a set of domains (i.e., finite sets of possible values for each variable), and C a set of constraints restricting the values that the variables can simultaneously take.
For each constraint, an error function needs to be defined:
it gives, for each tuple of variable values (i.e., a variable assignment), an indication on how much the constraint is violated.
The algorithm also uses a short-term adaptive memory in the spirit of Tabu Search to avoid stagnation in local minima and loops.

This archive contains the source code of sequential and parallel versions of the Adaptive Search algorithm and its specialization on several examples.

Project Activity

See All Activity >

Categories

Follow Adaptive Search

Adaptive Search Web Site

Other Useful Business Software

ManageEngine Now Lets You Patch Computers From Cloud Icon
ManageEngine Now Lets You Patch Computers From Cloud Icon

ManageEngine Patch Manager Plus offers patching capabilities on cloud - Patch all OS updates and 550 third party apps on-demand and stay secure!

Last year saw the hackers unleash their expertise in skills for a ransom - targeting those unpatched computers in data-critical institutions. Only if the computers were patched on time, billions of dollars could have been saved. ManageEngine’s Patch Manager Plus comes to your rescue, offering you an automated patching solution, now on cloud, for latest hotfixes of Windows updates and a wide range of third-party applications (over 550 of them).
Automate patching with Patch Manager Plus, sit back & relax!
Try FREE Trial

Rate This Project

Login To Rate This Project

User Reviews

Be the first to post a review of Adaptive Search!

Additional Project Details

Registered

2013-03-12