Algorithm for a Tabu -- Ant Colony Optimizer
Abstract
A novel Ant inspired method is introduced in which both positive and negative pheromones are used to guide the ant's selection process. The negative pheromone serves to influence the decision (much like a tabu search) to discourage the exploration of known bad paths. The positive pheromone serves to attract ants to known good paths (as in any conventional ACO.) Psuedocode for the new algorithm is provided. The dual-pheromone, Tabu-ACO is tested against a classic (positive pheromone only) ACO and the results compared. The Prize Collecting Steiner Tree problem is used to benchmark results.
Recommended Citation
D. D. Haynes and S. Corns, "Algorithm for a Tabu -- Ant Colony Optimizer," Proceedings of the 2015 IEEE Congress on Evolutionary Computation (2015, Sendai, Japan), pp. 529 - 535, Institute of Electrical and Electronics Engineers (IEEE), May 2015.
The definitive version is available at https://doi.org/10.1109/CEC.2015.7256935
Meeting Name
2015 IEEE Congress on Evolutionary Computation, CEC 2015 (2015: May 25-28, Sendai, Japan)
Department(s)
Engineering Management and Systems Engineering
Keywords and Phrases
Algorithms; Animals; Artificial intelligence; Bioinformatics; Biological systems; Cybernetics; Distributed parameter control systems; Evolutionary algorithms; Genetic algorithms; Optimization; Parallel algorithms; Problem solving; Stochastic systems; Tabu search; Trees (mathematics); Biological system modeling; Distributed control; Optimization methods; Stochastic Automata; Trees (graphs); Ant colony optimization
International Standard Book Number (ISBN)
978-1-4799-7492-4
International Standard Serial Number (ISSN)
1089-778X; 1941-0026
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2015 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
Publication Date
01 May 2015
