|
|||||
|
|
A bare-bones ant colony optimization algorithm that performs competitively on the sequential ordering problem |
|
| Authors: | Ahmed Ezzat Ashraf M Abdelbar Donald C Wunsch II |
| Institution: | 1. Department of Computer Science and Engineering, American University in Cairo, Cairo, Egypt 2. Department of Mathematics and Computer Science, Brandon University, Brandon, MB, Canada 3. Department of Electrical and Computer Engineering, Missouri University of Science and Technology, Rolla, MO, USA |
| 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |