Solving Traveling Salesman Problems by Artificial Immune Response
This paper introduces a computational model simulating the dynamic process of human immune 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 immunodominance rules construct an immunodominance set based on the prior knowledge of the problem. The antibodies can gain the immunodominance 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.
Unable to display preview. Download preview PDF.
- 3.Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer, Heidelberg (1994)Google Scholar
- 8.Burnet, F.M.: The Clonal Selection Theory of Acquired Immunity. Cambridge University Press, Cambridge (1959)Google Scholar
- 9.Burnet, F.M.: Clonal selection and after. Theoretical Immunology, pp. 63–85. Marcel Dekker, New York (1978)Google Scholar
- 10.Garrett, S.M.: Parameter-free, Adaptive Clonal Selection. In: The Proceedings of IEEE Congress on Evolutionary Computing (CEC 2004), Portland Oregon, June 2004, pp. 1052–1058 (2004)Google Scholar