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

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.