For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Novel Clonal Selection Algorithm and Its Application to Traveling Salesman Problem
Shangce GAO Hongwei DAI Gang YANG Zheng TANG
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2007/10/01
Online ISSN: 1745-1337
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Neural Networks and Bioengineering
Clonal Selection Algorithm, receptor editing, Traveling Salesman Problem, somatic maturation, affinity,
Full Text: PDF(380.1KB)>>
The Clonal Selection Algorithm (CSA) is employed by the natural immune system to define the basic features of an immune response to an antigenic stimulus. In the immune response, according to Burnet's clonal selection principle, the antigen imposes a selective pressure on the antibody population by allowing only those cells which specifically recognize the antigen to be selected for proliferation and differentiation. However ongoing investigations indicate that receptor editing, which refers to the process whereby antigen receptor engagement leads to a secondary somatic gene rearrangement event and alteration of the receptor specificity, is occasionally found in affinity maturation process. In this paper, we extend the traditional CSA approach by incorporating the receptor editing method, named RECSA, and applying it to the Traveling Salesman Problem. Thus, both somatic hypermutation (HM) of clonal selection theory and receptor editing (RE) are utilized to improve antibody affinity. Simulation results and comparisons with other general algorithms show that the RECSA algorithm can effectively enhance the searching efficiency and greatly improve the searching quality within reasonable number of generations.