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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shangce GAO, Hongwei DAI, Gang YANG, Zheng TANG, "A Novel Clonal Selection Algorithm and Its Application to Traveling Salesman Problem" in IEICE TRANSACTIONS on Fundamentals,
vol. E90-A, no. 10, pp. 2318-2325, October 2007, doi: 10.1093/ietfec/e90-a.10.2318.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.10.2318/_p
Copy
@ARTICLE{e90-a_10_2318,
author={Shangce GAO, Hongwei DAI, Gang YANG, Zheng TANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Novel Clonal Selection Algorithm and Its Application to Traveling Salesman Problem},
year={2007},
volume={E90-A},
number={10},
pages={2318-2325},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e90-a.10.2318},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - A Novel Clonal Selection Algorithm and Its Application to Traveling Salesman Problem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2318
EP - 2325
AU - Shangce GAO
AU - Hongwei DAI
AU - Gang YANG
AU - Zheng TANG
PY - 2007
DO - 10.1093/ietfec/e90-a.10.2318
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E90-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2007
AB - 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.
ER -