scholarly journals Improved Clonal Selection Algorithm Based on Biological Forgetting Mechanism

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Chao Yang ◽  
Bing-qiu Chen ◽  
Lin Jia ◽  
Hai-yang Wen

The antibody candidate set generated by the clonal selection algorithm has only a small number of antibodies with high antigen affinity to obtain high-frequency mutations. Among other antibodies, some low-affinity antibodies are replaced by new antibodies to participate in the next clonal selection. A large number of antibodies with high affinity make it difficult to participate in clonal selection and exist in antibody concentration for a long time. This part of inactive antibody forms a “black hole” of the antibody set, which is difficult to remove and update in a timely manner, thus affecting the speed at which the algorithm approximates the optimal solution. Inspired by the mechanism of biological forgetting, an improved clonal selection algorithm is proposed to solve this problem. It aims to use the abstract mechanism of biological forgetting to eliminate antibodies that cannot actively participate in high-frequency mutations in the antibody candidate set and to improve the problem of insufficient diversity of antibodies in the clonal selection algorithm, which is prone to fall into the local optimal. Compared with the existing clonal selection and genetic algorithms, the experiment and time complexity analysis show that the algorithm has good optimization efficiency and stability.


2012 ◽  
Vol 256-259 ◽  
pp. 2943-2946
Author(s):  
Yi Li ◽  
Zhen Hui Song ◽  
Li Zhao

Aiming at the problem of path planning for a mobile robot, an oriented clonal selection algorithm is proposed. Firstly, the static environment was expressed by a map with nodes and links. Secondly, the locations of target and obstacles were defined. Thirdly, an oriented mutation operator was used to accelerate the evolutionary progress. In this way, we can find an optimal solution with proposed oriented clonal algorithm. Experiment results demonstrate that the algorithm is simple, effective, to solve the problem of robot path planning in a static environment









Sign in / Sign up

Export Citation Format

Share Document