Comet™ simplifies the design of local search algorithms
One of the key innovations of the Comet™ system is constraint-based local search (CBLS), the idea of specifying local search algorithms as two components:
(1) a high-level model describing the applications in terms of
constraints, constraint combinators, and objective functions
(2) a clearly separated search procedure that implicitly takes advantage of the model in a general fashion.
The computational model underlying constraint-based local search uses constraints and objectives to drive the search procedure toward feasible, high-quality solutions. As a result, Comet can dramatically simplify your design and implementation of (stochastic) local search algorithms, while preserving the efficiency of low-level, problem-specific, implementations. Read more.
Constraint-Based Local Search Capabilities in Comet
- Local search on high-level optimization models
- Invariants and differential invariants for incremental computations
- Rich constraint and objective language, including arithmetic, logical, and global/combinatorial constraints
- Ability to model soft constraints and preferences
- Support for meta-heuristics, including tabu-search, simulated annealing, variable-depth neighborhood search, guided local search, and hybrid evolutionary algorithms