An Ant Colony Optimization Algorithm with Evolutionary Operator for Traveling Salesman Problem

Authors:
Jinglei Guo;Yong Wu;Wei Liu
Affiliations:
Central China Normal University, China;Wuhan University of Technology, China;Central China Normal University, China
Venue:
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 01
Year:
2006

Citing 0
Cited 4

A memetic model of evolutionary PSO for computational finance applications

Expert Systems with Applications: An International Journal
The wise experiencing traveling salesman (WETS): introduction to a simple evolutionary solution for the problem

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
An effective particle swarm optimization algorithm embedded in SA to solve the traveling salesman problem

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
A dynamic max-min ant system for solving the travelling salesman problem

International Journal of Bio-Inspired Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ant colony optimization (ACO) is an optimization computation inspired by the study of the ant colonies' behavior. The combinational optimization process sometimes is based on the pheromone model and solution construction process. It remains a computational bottleneck because the ACO algorithm costs too much time to find an optimal solution for large-scale optimization problems. In this paper, a quickly convergent method of the ACO algorithm with evolutionary operator (ACOEO) is presented. In the method, crossover and mutation operator together provide a search capability that enhance rate of convergence. In addition, we adopt a dynamic selection means based on the fitness of each ant. The tours of better ants have high opportunity to obtain pheromone updating. Finally, our research clearly shows that ACOEO has the property of effectively guiding the search towards promising regions in the search space. The computer simulations demonstrate that the convergence speed and optimization performance are better than the ACO algorithm.