COMET

Comet is an Award-winning tool for solving complex combinatorial optimization problems in areas such as resource allocation and scheduling. It may dramatically simplify the design and implementation of (stochastic) local search algorithms, while preserving the efficiency of low-level, problem-specific, implementations. Comet is described in the book "Constraint-Based Local Search" published by MIT Press

Comet's underlying computational paradigm is Constraint-based Local Search, the idea of specifying local search algorithms as two components: a high-level model describing the applications in terms of constraints, constraint combinators, and objective functions; a search procedure expressed in terms of the model at a high abstraction level.

For more information, visit www.comet-online.org.