Nature-inspired algorithms for the TSP

Three nature-inspired algorithms are applied to solve Travelling Salesman Problem (TSP). The first originally developed Multi-agent Evolutionary Algorithm (MAEA) is based on multi-agent interpretation of TSP problem. An agent is assigned to a single city and builds locally its neighbourhood - a subset of cities, which are considered as local candidates to a global solution of TSP. Creating cycles - global solutions of TSP is based on Ant Colonies (AC) paradigm. Found cycles are placed in Global Table and are evaluated by genetic algorithm (CA) to modify a rank of cities in local neighbourhood. MAEA is compared with two another algorithms: artificial immune - based system (AIS) and a standard AC - both applied to TSP. We present experimental results showing that MAEA outperforms both AIS and AC algorithms.