When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems

@article{Tarrant2005WhenAA,
  title={When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems},
  author={Finbarr Tarrant and Derek G. Bridge},
  journal={Artificial Intelligence Review},
  year={2005},
  volume={24},
  pages={455-476}
}
We describe an ant algorithm for solving constraint problems (Solnon 2002, IEEE Transactions on Evolutionary Computation 6(4): 347–357). We devise a number of variants and carry out experiments. Our preliminary results suggest that the best way to deposit pheromone and the best heuristics for state transitions may differ from current practice 

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Ants can solve constraint satisfaction problems

IEEE Trans. Evolutionary Computation • 2002
View 20 Excerpts
Highly Influenced

Foundations of constraint satisfaction

Computation in cognitive science • 1993
View 5 Excerpts
Highly Influenced

Cyclic Path-Based Environment: an Ant Environment for Solving Distributed Constraint Satisfaction Problems

K. Mertens, E. Steegmans, T. Holvoet
In M. Yokoo (ed.) Proceedings of the 3rd International Workshop on Distributed Constraint Reasoning, • 2002
View 2 Excerpts

Ant Colonies are Good at Solving Constraint Satisfaction Problems

L. Schoofs, B. Naudts
In Proceedings of the 2000 Congress on Evolutionary Computation, • 2000
View 1 Excerpt

Improvements on the Ant System: Introducing the MAX −MIN Ant System

T. Stützle, H. Hoos
Proceedings of Artificial Neural Nets and Genetic Algorithms • 1998
View 1 Excerpt

Applying the Ant System to the Vehicle Routing

ProblemBernd Bullnheimer, Richard F. Hartl, Christine StraussDepartment
1997
View 1 Excerpt

Similar Papers

Loading similar papers…