By Topic

Improving performance of ACO algorithms using crossover mechanism based on mean of pheromone tables

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gokalp, O. ; Dept. of Software Eng., Yasar Univ., Izmir, Turkey ; Ugur, A.

Ant Colony Optimization (ACO) Algorithms have been used to solve many optimization problems in various fields and several algorithms have been proposed based on ACO metaheuristic in the literature. This paper proposes a simple crossover mechanism based on mean of pheromone tables for ACO algorithms. Main purpose of the crossover operation is to produce solutions or individuals having greater performance than their parents by selecting useful parts. Original ACO Algorithms don't have crossover. Method that we developed employs more than one ant colonies and also solutions. Suitable low-cost average based operations are then applied to pheromone tables obtained after several iterations as crossover operator. Algorithm is tested on Traveling Salesman Problem using some benchmark problems from TSPLIB and results are presented. Our experiments and comparisons show that crossover mechanism improves the performance of ACO Algorithms.

Published in:

Innovations in Intelligent Systems and Applications (INISTA), 2012 International Symposium on

Date of Conference:

2-4 July 2012