When Ants Attack: Ant Algorithms for Constraint Satisfaction Problems

Authors:
Finbarr Tarrant;Derek Bridge
Affiliations:
Department of Computer Science, University College Cork, Cork, Ireland;Department of Computer Science, University College Cork, Cork, Ireland
Venue:
Artificial Intelligence Review
Year:
2005

Citing 7
Cited 1

Ant algorithms for discrete optimization

Artificial Life
Random Constraint Satisfaction: A More Accurate Picture

Constraints
Random Constraint Satisfaction: Flaws and Structure

Constraints
Generating Satisfiable Problem Instances

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The constrainedness of search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Ants can solve constraint satisfaction problems

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

The power of ants in solving Distributed Constraint Satisfaction Problems

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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