Solving Constraint Satisfaction Problems with ACO
Solving Constraint Satisfaction Problems with ACO
AntSolver is a program (in C) for solving constraint satisfaction problems.
It is distributed under the CeCILLB FREE SOFTWARE LICENSE.
Reference
The algorithms used by AntSolver to solve CSPs are described in:
 Christine Solnon and Derek Bridge: An Ant Colony Optimization MetaHeuristic for Subset Selection Problems. Chapter of the book « System Engineering using Particle Swarm Optimization »  March 2006  Nova Science publisher  pages 729
A draft version is available as a research report LIRIS RR2005017 (pdf)
 Christine Solnon: Ants Can Solve Constraint Satisfaction Problems. IEEE Transactions on Evolutionary Computation  August 2002  Vol.6  N°4  pages 347357
Draft version of the paper (postscript)
and in

Ant Colony Optimization and Constraint Programming
WileyISTE, ISBN: 9781848211308, 232 pages
Table of contents

