Baldwinian learning in clonal selection algorithm for optimization

被引:75
作者
Gong, Maoguo [1 ]
Jiao, Licheng [1 ]
Zhang, Lining [1 ]
机构
[1] Xidian Univ, Key Lab Intelligent Percept & Image Understanding, Minist Educ China, Inst Intelligent Informat Proc, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
Baldwin effect; Clonal selection; Artificial immune systems; Evolutionary algorithms; Optimization; ARTIFICIAL IMMUNE-SYSTEM; GENETIC ALGORITHM; DIFFERENTIAL EVOLUTION; OPTIMAL APPROXIMATION; GLOBAL OPTIMIZATION; LINEAR-SYSTEMS; MODEL;
D O I
10.1016/j.ins.2009.12.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Artificial immune systems are a kind of new computational intelligence methods which draw inspiration from the human immune system. Most immune system inspired optimization algorithms are based on the applications of clonal selection and hypermutation, and known as clonal selection algorithms. These clonal selection algorithms simulate the immune response process based on principles of Darwinian evolution by using various forms of hypermutation as variation operators. The generation of new individuals is a form of the trial and error process. It seems very wasteful not to make use of the Baldwin effect in immune system to direct the genotypic changes. In this paper, based on the Baldwin effect. an improved clonal selection algorithm, Baldwinian Clonal Selection Algorithm, termed as BCSA, is proposed to deal with optimization problems. BCSA evolves and improves antibody population by four operators, clonal proliferation, Baldwinian learning, hypermutation, and clonal selection. It is the first time to introduce the Baldwinian learning into artificial immune systems. The Baldwinian learning operator simulates the learning mechanism in immune system by employing information from within the antibody population to alter the search space. It makes use of the exploration performed by the phenotype to facilitate the evolutionary search for good genotypes. In order to validate the effectiveness of BCSA, eight benchmark functions, six rotated functions, six composition functions and a real-world problem, optimal approximation of linear systems are solved by BCSA, successively. Experimental results indicate that BCSA performs very well in solving most of the test problems and is an effective and robust algorithm for optimization. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:1218 / 1236
页数:19
相关论文
共 47 条
  • [1] ACKLEY D, 1992, SFI S SCI C, V10, P487
  • [2] [Anonymous], 1896, AM NATURALIST
  • [3] Baldwin JM, 1896, AM NAT, V30, P441, DOI DOI 10.1086/276408
  • [4] Immune K-means and negative selection algorithms for data analysis
    Bereta, Michal
    Burczynski, Tadeusz
    [J]. INFORMATION SCIENCES, 2009, 179 (10) : 1407 - 1425
  • [5] Bullinaria JA, 2000, PERSP NEURAL COMP, P231
  • [6] Burnet M., 1959, The clonal selection theory of acquired immunity, DOI [10.5962/bhl.title.8281, DOI 10.5962/BHL.TITLE.8281]
  • [7] Capra, 1997, Immunobiology: the immune system in health and disease
  • [8] The immune system as a model for pattern recognition and classification
    Carter, JH
    [J]. JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, 2000, 7 (01) : 28 - 41
  • [9] Optimal approximation of linear systems by a differential evolution algorithm
    Cheng, SL
    Hwang, C
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2001, 31 (06): : 698 - 707
  • [10] Cutello V, 2004, LECT NOTES COMPUT SC, V3239, P263