The Immune Distributed Competitive Problem Solver Using Major Histocompatibility Complex and Immune Network

Abstract

The purpose of this paper is to propose an extended immune optimization algorithm using division as well as integration processing based on immune cell-cooperation and to investigate its validity by computer simulations. In the biological immune system, the immune cell-cooperation is a framework including MHC and immune network, the function of which is to eliminate unknown vast antigens. Our algorithm solves the division-of-labor problems for each agent’s work domain inside the multi-agent system (MAS) through interactions between two agents, and those of between agents and environment through the work of immune functions. There are three functions in our algorithm: the division as well as integration processing and the co-evolutionary-like approach. The division as well as integration processing optimizes the work domain, and the co-evolutionary approach realizes equal divisions. In order to investigate the validity of the proposed method, this algorithm is applied to the “Nth agent’s Travelling Salesmen Problem (called the n-TSP)” as a typical problem of multi-agent system. The property that is believed to function as solution driver for MAS shall be clarified using several simulations.