Solving traveling salesman problems by artificial immune response

This paper introduces a computational model simulating the dynamic process of human inumme response for solving Traveling Salesman Problems (TSPs). The new model is a quaternion (G, I, R, Al), where G denotes exterior stimulus or antigen, I denotes the set of valid antibodies, R denotes the set of reaction rules describing the interactions between antibodies, and Al denotes the dynamic algorithm describing how the reaction rules are applied to antibody population. The set of immunodominance rules, the set of clonal selection rules, and a dynamic algorithm TSP-PAISA are designed. The inummodommance rules construct an immunodominance set based on the prior knowledge of the problem. The antibodies can gain the immunodonmiance from the set. The clonal selection rules strengthen these superior antibodies. The experiments indicate that TSP-PAISA is efficient in solving TSPs and outperforms a known TSP algorithm, the evolved integrated self-organizing map.