Approach by ant tabu agents for Traveling Salesman Problem

Author

Kaji, Taichi

Author_Institution

Dept. of Inf. & Manage. Sci., Otaru Univ. of Commerce, Japan

Volume

5

fYear

2001

fDate

2001

Firstpage

3429

Abstract

The ant system (AS) algorithm of M. Dorigo et al. (1996) is a new computational paradigm, which is a stochastic combinatorial algorithm. It solves optimization problems by means of "ants", that is, agents with a very simple basic capability, which mimic the behavior of real ants. The AS proposed by Dorigo has appealing features, but in its standard form it has some limitations. Applied to the Traveling Salesman Problem, the AS approach encounters difficulties when applied to random graphs. To remedy this, we design a new type of agent by using intensification and diversification strategies, based on the proposals of tabu search, in order to reach better solutions

Keywords

graph theory; multi-agent systems; search problems; stochastic processes; travelling salesman problems; AS algorithm; Traveling Salesman Problem; ant tabu agents; computational paradigm; diversification strategies; intensification; multi agents; optimization problems; random graphs; real ant behavior mimicing; stochastic combinatorial algorithm; tabu search; Cities and towns; Costs; Equations; Traveling salesman problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 2001 IEEE International Conference on

Conference_Location

Tucson, AZ

ISSN

1062-922X

Print_ISBN

0-7803-7087-2

Type

conf

DOI

10.1109/ICSMC.2001.972050

Filename

972050