An immune co-evolutionary algorithm for n-th agent's traveling salesman problem

The purpose of this paper is to evaluate an immune optimization algorithm using a biological immune co-evolutionary phenomenon and cell-cooperation. The co-evolutionary model searches solutions through the interactions between two kinds of agents, on the agent is called immune agent, which optimizes the cost of its own work. The other is call antigen agent, which realized the equal work assignment. This algorithm solves the division-of-labor problems in multi-agent system (MAS) through the three kinds of interactions: division-and-integration processing is used for optimization of the work-cost of immune agents and immune cell-cooperation is used to perform equal work assignment as a result of evolving the antigen agents. To investigate the validity, this algorithm is applied to "n-th agent's traveling salesman problem" as a typical problem of MAS. The good property on solving for MAS will be clarified by some simulations.

[1]  Alan S. Perelson,et al.  The immune system, adaptation, and machine learning , 1986 .

[2]  Hugues Bersini,et al.  The Immune Recruitment Mechanism: A Selective Evolutionary Strategy , 1991, ICGA.

[3]  C. Janeway.  Immunobiology: The Immune System in Health and Disease , 1996 .

[4]  Norihiko Adachi,et al.  Active noise control by an immune algorithm: adaptation in immune system as an evolution , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[5]  Hayao Miyagi,et al.  The immune distributed competitive problem solver with major histocompatibility complex and immune network , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.