Immune algorithm for n-TSP

As the neural networks or genetic algorithms, adaptive algorithms become popular and these techniques are applied to many kinds of optimization problems. The immune system is one of the adaptive biological system whose functions are to identify and to eliminate foreign material. In this paper, we propose an optimization algorithm based on immune model and applied to the n-th agents´ travelling salesman problem called n-TSP. Some computer simulations are designed to investigate the performance of the immune algorithm. The results of simulations represent that the immune algorithm shows good performance for the combinatorial optimization problems