Using ant colony systems with pheromone dispersion in the traveling salesman problem

Authors:
José Carlos Becceneri;Sandra Sandri;E.F. Pacheco da Luz
Affiliations:
LAC/INPE, Brazil;IIIA-CSIC, Spain;LAC/INPE, Brazil
Venue:
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Year:
2008

Citing 4
Cited 0

What are fuzzy rules and how to use them

Fuzzy Sets and Systems - Special issue dedicated to the memory of Professor Arnold Kaufmann
Ant algorithms for discrete optimization

Artificial Life
From Natural to Artificial Swarm Intelligence

From Natural to Artificial Swarm Intelligence
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Here we investigate the use of Ant Colony Systems (ACS) for the Traveling Salesman Problem (TSP). We propose the use of a modified ACS for graph problems in which we allow an artificial ant to lay down pheromone, not only on the edges in its path, but also on edges close to it: the closer a given edge is to one of those in the ant's path, the more pheromone it receives. The notion of edge closeness in the TSP takes into account not only the closeness among the nodes composing the edges but also the edges orientation.