A Bare-Bones Ant Colony Optimization Algorithm that Performs Competitively on the Sequential Ordering Problem
Abstract
EigenAnt is a bare-bones ant colony optimization algorithm that has been proven to converge to the optimal solution under certain conditions. In this paper, we extend EigenAnt to the sequential ordering problem (SOP), comparing its performance to Gambardella et al.'s enhanced ant colony system (EACS), a model that has been found to have state-of-the-art performance on the SOP. Our experimental results, using the SOPLIB2006 instance library, indicate that there is no statistically significant difference in performance between our proposed method and the state-of-the-art EACS method.
Recommended Citation
A. Ezzat et al., "A Bare-Bones Ant Colony Optimization Algorithm that Performs Competitively on the Sequential Ordering Problem," Memetic Computing, vol. 6, no. 1, pp. 19 - 29, Springer Verlag, Jan 2014.
The definitive version is available at https://doi.org/10.1007/s12293-013-0129-z
Department(s)
Electrical and Computer Engineering
Research Center/Lab(s)
Center for High Performance Computing Research
International Standard Serial Number (ISSN)
1865-9284
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2014 Springer Verlag, All rights reserved.
Publication Date
01 Jan 2014
