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.
| Original language | English |
|---|---|
| Title of host publication | 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6 |
| Place of Publication | NEW YORK |
| Publisher | IEEE |
| Pages | 1647-1654 |
| Number of pages | 8 |
| ISBN (Print) | 978-0-7803-9487-2 |
| Publication status | Published - 2006 |
| Event | IEEE Congress on Evolutionary Computation - Vancouver Duration: 16 Jul 2006 → 21 Jul 2006 |
Conference
| Conference | IEEE Congress on Evolutionary Computation |
|---|---|
| City | Vancouver |
| Period | 16/07/06 → 21/07/06 |
Keywords
- OPTIMIZATION