When ants attack: Ant algorithms for constraint satisfaction problems

Finbarr Tarrant; Derek Bridge

doi:10.1007/s10462-005-9005-7

When ants attack: Ant algorithms for constraint satisfaction problems

Finbarr Tarrant
, Derek Bridge

University College Cork

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	455-476
Number of pages	22
Journal	Artificial Intelligence Review
Volume	24
Issue number	3-4
DOIs	https://doi.org/10.1007/s10462-005-9005-7
Publication status	Published - Nov 2005

Keywords

Ant algorithms
Constraint satisfaction problems

Access to Document

10.1007/s10462-005-9005-7

Cite this

@article{991ec0f9e7a5474e801ca11c7b774d6b,

title = "When ants attack: Ant algorithms for constraint satisfaction problems",

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.",

keywords = "Ant algorithms, Constraint satisfaction problems",

author = "Finbarr Tarrant and Derek Bridge",

year = "2005",

month = nov,

doi = "10.1007/s10462-005-9005-7",

language = "English",

volume = "24",

pages = "455--476",

journal = "Artificial Intelligence Review",

issn = "0269-2821",

publisher = "Springer Netherlands",

number = "3-4",

}

TY - JOUR

T1 - When ants attack

T2 - Ant algorithms for constraint satisfaction problems

AU - Tarrant, Finbarr

AU - Bridge, Derek

PY - 2005/11

Y1 - 2005/11

N2 - 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.

AB - 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.

KW - Ant algorithms

KW - Constraint satisfaction problems

UR - https://www.scopus.com/pages/publications/29144509560

U2 - 10.1007/s10462-005-9005-7

DO - 10.1007/s10462-005-9005-7

M3 - Article

AN - SCOPUS:29144509560

SN - 0269-2821

VL - 24

SP - 455

EP - 476

JO - Artificial Intelligence Review

JF - Artificial Intelligence Review

IS - 3-4

ER -

When ants attack: Ant algorithms for constraint satisfaction problems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this