Solving Constraint Satisfaction Problems with ACO
AntSolver is a program (in C) for solving constraint satisfaction problems.
It is distributed under the CeCILL-B FREE SOFTWARE LICENSE.
Reference
The algorithms used by AntSolver to solve CSPs are described in:
- Christine Solnon and Derek Bridge: An Ant Colony Optimization Meta-Heuristic for Subset Selection Problems. Chapter of the book « System Engineering using Particle Swarm Optimization » - March 2006 - Nova Science publisher - pages 7-29
A draft version is available as a research report LIRIS RR-2005-017 (pdf)
- Christine Solnon: Ants Can Solve Constraint Satisfaction Problems. IEEE Transactions on Evolutionary Computation - August 2002 - Vol.6 - N°4 - pages 347-357
Draft version of the paper (postscript)
and in
-
Ant Colony Optimization and Constraint Programming
Wiley-ISTE, ISBN: 978-1-84821-130-8, 232 pages
Table of contents
|
|