DocumentCode
2463594
Title
A Study of Concurrency in the Ant Colony System Algorithm
Author
Ridge, Enda ; Kudenko, Daniel ; Kazakov, Dimitar
Author_Institution
Univ. of York, York
fYear
0
fDate
0-0 0
Firstpage
1662
Lastpage
1669
Abstract
This paper reports the results of a study of a specific type of concurrency in the ant colony system (ACS) algorithm. Studies of cellular automata (CA) have shown that the update mechanism used can have a dramatic influence on the dynamics of the CA. ACS is usually implemented with a sequential update mechanism. A new method for controlling the concurrency in a nature-inspired algorithm is introduced. Comprehensive tests on a wide range of problem instances are reported. The study found that concurrency levels had no statistically significant effect on ACS performance. This result is interesting because it contradicts what has been observed in another form of nature-inspired algorithm, namely CAs.
Keywords
cellular automata; concurrency control; optimisation; ant colony system algorithm; cellular automata; concurrency control; sequential update mechanism; Automata; Automatic control; Cities and towns; Concurrent computing; Content addressable storage; Evolutionary computation; Genetic algorithms; Multiagent systems; Neurons; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2006. CEC 2006. IEEE Congress on
Conference_Location
Vancouver, BC
Print_ISBN
0-7803-9487-9
Type
conf
DOI
10.1109/CEC.2006.1688508
Filename
1688508
Link To Document