Improved ACO Algorithm with Pheromone Correction Strategy for the Traveling Salesman Problem
|
| Title | Improved ACO Algorithm with Pheromone Correction Strategy for the Traveling Salesman Problem |
| Authors | |
| Abstract | A new, improved ant colony optimization (ACO) algorithm with novel pheromone correction strategy is introduced. It is implemented and tested on the traveling salesman problem (TSP). Algorithm modification is based on undesirability of some elements of the current best found solution. The pheromone values for highly undesirable links are significantly lowered by this a posteriori heuristic. This new hybridized algorithm with the strategy for avoiding stagnation by leaving local optima was tested on standard benchmark problems from the TSPLIB library and superiority of our method to the basic ACO and also to the particle swarm optimization (PSO) is shown. The best found solutions are improved, as well as the mean values for multiple runs. The computation cost increase for our modification is negligible. |
| Publisher | Agora University of Oradea |
| Date | 2013-06-02 |
| Source | International Journal of Computers Communications & Control Vol 8, No 3 (2013): INT J COMPUT COMMUN |
| Rights | Copyright Transfer FormThe undersigned Author(s) of the above mentioned Paper here by transfer any and all copyright-rights in and to The Paper to The Publisher.The Author(s) warrants that The Paper is based on their original work and that the undersigned has the power and authority to make and execute this assignment. It is the author´s responsibility to obtain written permission to quote material that has been previously published in any form.The Publisher recognizes the retained rights noted below and grants to the above authors and employers for whom the work performed royalty-free permission to reuse their materials below. Authors may reuse all or portions of the above Paper in other works, excepting the publication of the paper in the same form. Authors may reproduce or authorize others to reproduce the above Paper for the Author´s personal use or for internal company use, provided that the source and The Publisher copyright notice are mentioned, that the copies are not used in any way that implies The Publisher endorsement of a product or service of an employer, and that the copies are not offered for sale as such. Authors are permitted to grant third party requests for reprinting, republishing or other types of reuse. The Authors may make limited distribution of all or portions of the above Paper prior to publication if they inform The Publisher of the nature and extent of such limited distribution prior there to. Authors retain all proprietary rights in any process, procedure, or article of manufacture described in The Paper. This agreement becomes null and void if and only if the above paper is not accepted and published by The Publisher, or is withdrawn by the author(s) before acceptance by the Publisher. |