A Neuro-Immune Algorithm to Solve the Capacitated Vehicle Routing Problem
ICARIS '08 Proceedings of the 7th international conference on Artificial Immune Systems
Neuro-immune approach to solve routing problems
Neurocomputing
Hi-index | 0.00 |
Most discrete optimization problems belong to the NP-complete or NP-hard classes. A benchmark prob- lem to assess the performance of new heuristics to solve these classes of problems is the traveling sales- man problem (TSP). This paper proposes some modifi- cations on a self-organizing network, named RABNET- TSP, to solve TSP problems. The modified algorithm is compared, with encouraging results, to other propos- als from the literature on a number of different TSP instances.