Asteroid has been merged with Scampi, to give rise to OScar.
Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home
Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms.
- Contraint-based local search framework
- Partial propagation of updates for fast neightbor exploration
- Static dependency graph can be cyclic
- Invariant library
- Constraint Library
- JobShop Scheduling
- Supported types are IntVar and IntSetVar
Asteroid fills a hole that has been there for several years, namely an open-source and easy-to-use constraint-based local search framework. This is very much appreciated. Keep up the good work on this!
Very promising framework