Improved ACO algorithm with pheromone correction strategy for the traveling salesman problem

Milan Tuba, Raka Jovanovic

Research output: Contribution to journalArticle

49 Citations (Scopus)

Abstract

A new, improved ant colony optimization algorithm with novel pheromone correction strategy is introduced. It is implemented and tested on the traveling salesman problem. 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 ant colony optimization and also to the particle swarm optimization 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.

Original languageEnglish
Pages (from-to)477-485
Number of pages9
JournalInternational Journal of Computers, Communications and Control
Volume8
Issue number3
Publication statusPublished - 1 Jan 2013

Fingerprint

Traveling salesman problem
Ant colony optimization
Particle swarm optimization (PSO)
Costs

Keywords

  • Ant colony optimization (ACO)
  • Metaheuristics
  • Nature inspired algorithms
  • Swarm intelligence
  • Traveling salesman problem (TSP)

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications

Cite this

@article{4f97b6b4dac944308ad19ff37a3a3a6e,
title = "Improved ACO algorithm with pheromone correction strategy for the traveling salesman problem",
abstract = "A new, improved ant colony optimization algorithm with novel pheromone correction strategy is introduced. It is implemented and tested on the traveling salesman problem. 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 ant colony optimization and also to the particle swarm optimization 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.",
keywords = "Ant colony optimization (ACO), Metaheuristics, Nature inspired algorithms, Swarm intelligence, Traveling salesman problem (TSP)",
author = "Milan Tuba and Raka Jovanovic",
year = "2013",
month = "1",
day = "1",
language = "English",
volume = "8",
pages = "477--485",
journal = "International Journal of Computers, Communications and Control",
issn = "1841-9836",
publisher = "CCC Publications, R & D Agora",
number = "3",

}

TY - JOUR

T1 - Improved ACO algorithm with pheromone correction strategy for the traveling salesman problem

AU - Tuba, Milan

AU - Jovanovic, Raka

PY - 2013/1/1

Y1 - 2013/1/1

N2 - A new, improved ant colony optimization algorithm with novel pheromone correction strategy is introduced. It is implemented and tested on the traveling salesman problem. 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 ant colony optimization and also to the particle swarm optimization 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.

AB - A new, improved ant colony optimization algorithm with novel pheromone correction strategy is introduced. It is implemented and tested on the traveling salesman problem. 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 ant colony optimization and also to the particle swarm optimization 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.

KW - Ant colony optimization (ACO)

KW - Metaheuristics

KW - Nature inspired algorithms

KW - Swarm intelligence

KW - Traveling salesman problem (TSP)

UR - http://www.scopus.com/inward/record.url?scp=84885658258&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885658258&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84885658258

VL - 8

SP - 477

EP - 485

JO - International Journal of Computers, Communications and Control

JF - International Journal of Computers, Communications and Control

SN - 1841-9836

IS - 3

ER -