A new mutation rule for evolutionary programming motivated from backpropagation learning

被引:20
作者
Choi, DH [1 ]
Oh, SY
机构
[1] Seoul Natl Univ, Sch Elect Engn & Comp Sci, Coll Engn, Seoul 151742, South Korea
[2] Pohang Univ Sci & Technol, Dept Elect Engn, Pohang 790784, South Korea
关键词
backpropagation; evolutionary computation; evolutionary programming; mutation;
D O I
10.1109/4235.850659
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Evolutionary programming is mainly characterized by two factors: the selection strategy and the mutation rule. This letter presents a new mutation rule that has the same form as the well-known backpropagation learning rule for neural networks. The proposed mutation rule assigns the best individual's fitness as the temporary target at each generation. The temporal error, the distance between the target and an individual at hand, is used to improve the exploration of the search space by guiding the direction of evolution. The momentum, i,e,, the accumulated evolution information for the individual, speeds up convergence. The efficiency and robustness of the proposed algorithm are assessed on several benchmark test functions.
引用
收藏
页码:188 / 190
页数:3
相关论文
共 9 条
  • [1] Back T., 1997, IEEE Transactions on Evolutionary Computation, V1, P3, DOI 10.1109/4235.585888
  • [2] Evolutionary computation: An overview
    Back, T
    Schwefel, HP
    [J]. 1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 20 - 29
  • [3] Fogel D.B., 1995, EVOLUTIONARY COMPUTA
  • [4] Fogel L., 1999, INTELLIGENCE SIMULAT
  • [5] Fogel L. J., 1966, ARTIFICIAL INTELLIGE, DOI DOI 10.1109/9780470544600.CH7
  • [6] Hagan MT., 1996, NEURAL NETWORK DESIG
  • [7] KIM JH, 1997, IEEE CONTR SYST, P38
  • [8] Michalewicz Z., 1996, GENETIC ALGORITHMS D
  • [9] Enhanced evolutionary programming for function optimization
    Wu, BL
    Yu, XH
    [J]. 1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 695 - 698