Applying opposition-based ideas to the Ant Colony System

Alice R. Malisia, Hamid R. Tizhoosh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents several extensions to an algorithm In the family of Ant Colony Optimization, the Ant Colony System. The proposed extensions are based on the idea of opposition and attempt to Increase the exploration efficiency of the solution space. The modifications focus on the solution construction phase of the ant colony system. Three of the proposed methods work by pairing the ants and synchronizing their path selection. The two other approaches modify the decisions of the ants by using an opposite-pheromone content. Results on the application of these algorithms on Travelling Salesman Problem Instances demonstrate that the concept of opposition is not easily applied to the ant algorithm. Only one of the pheromone-based methods showed performance improvements that were statistically significant. The quality of the solutions Increased and more optimal solutions were found. The other extensions showed no clear improvement. Further work must be conducted to explore the successful pheromonebased approach, as well as to determine if opposition should be applied to a different phase of the algorithm.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 IEEE Swarm Intelligence Symposium, SIS 2007
Pages182-189
Number of pages8
DOIs
StatePublished - 2007
Event2007 IEEE Swarm Intelligence Symposium, SIS 2007 - Honolulu, HI, United States
Duration: Apr 1 2007Apr 5 2007

Publication series

NameProceedings of the 2007 IEEE Swarm Intelligence Symposium, SIS 2007

Conference

Conference2007 IEEE Swarm Intelligence Symposium, SIS 2007
Country/TerritoryUnited States
CityHonolulu, HI
Period4/1/074/5/07

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Applying opposition-based ideas to the Ant Colony System'. Together they form a unique fingerprint.

Cite this