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 >

Follow Adaptive Search

Adaptive Search Web Site

Other Useful Business Software
APIs for the next generation of business text messaging Icon
APIs for the next generation of business text messaging

For companies that need a reliable messaging API provider

Get your customers’ messages where they need to go with 99%+ deliverability. Telgorithm’s API automates A2P compliance & message management for faster, easier, & more reliable messaging, enabling you to offer the best service to your customers.
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