.png){kind=icon}
Return
A bare-bones ant colony optimization algorithm that performs competitively on the sequential ordering problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s12293-013-0129-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
Ant colony optimization
Sequential ordering problem
Swarm intelligence
EigenAnt algorithm
Ant colony system
Metaheuristic
Traveling salesman problem
Journal
IF:
2.3
Papers:
453
Citations:
718
Organization
Cited Papers
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications.png)
RSC Adv.
RSC Adv.IF0
PREAI
ShareSaveShareSaveShareSaveShareSave
ShareSaveA simple protein-energy wasting score for survival prediction of maintenance hemodialysis patients
OAAI
OAAIShareSaveShareSave
View more