Ant Colony Optimization
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
ICICIC '06 Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1
Improved Ant Colony Algorithm and its Applications in TSP
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 02
Ant Colony with Stochastic Local Search for the Quadratic Assignment Problem
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
An emotional particle swarm optimization algorithm
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This paper presents a modification of the ant colony optimization algorithm (ACO) intended to introduce psychology factor of emotion into the algorithm. We define only two emotions ants could have, positive and negative, and correspond to two reaction to perception respectively. For avoiding premature convergence allows Emotional Ant Colony Optimization (EACO) to continue search for better even best optimization in difficult optimization problems, reaching better solutions than ACO with a faster convergence speed.