By Topic

Multi-agent Systems Applied to the Solution of the Traveling Salesman Problem

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)

The Traveling Salesman Problem is a NP-hard combinatorial optimization problem to which it has been tried to apply numerous techniques of solution. This work is focused on the description of several novel techniques inspired on systems present in the nature, formed by very simple agents who cooperate for the resolution of complex problems. It has been demonstrated that such techniques allow to obtain very good solutions in less time, that allows to apply them to great problems.

Published in:

Latin America Transactions, IEEE (Revista IEEE America Latina)  (Volume:2 ,  Issue: 1 )