Evolutionary programming with only using exponential mutation

被引：4
|
作者：
Narihisa, H. [1 ]
Kohmoto, K. [1 ]
Taniguchi, T.
Ohta, M.
Katayama, K.
机构：
[1] Klinki Univ, Sch Biol Oriented Sci & Technol, Dept Intelligence Syst, Wakayama 6496493, Japan
来源：
2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6 | 2006年
关键词：
D O I：
10.1109/CEC.2006.1688358
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The individual of population in standard self-adaptive evolutionary programming (EP) is composed as a pair of objective variable and strategy parameter. Therefore, EP must evolve both objective variable and strategy parameter. In standard evolutionary programming (CEP), these evolutions are implemented by mutation based on only Gaussian random number. On the other hand, fast evolutionary programming (FEP) uses Cauchy random number as evolution of objective variable and exponential evolutionary programming (EEP) uses exponential random number as evolution of objective variable. However, all of these EP (CEP, FEP and EEP) commonly uses Gaussian random number as evolution of strategy parameter. In this paper, we propose new EEP algorithm (NEP) which uses double exponential random number for both evolution of objective variable and strategy parameter. The experimental results show that this new algorithm (NEP) outperforms the existing CEP and FEP.
引用
收藏
页码：552 / +
页数：3
相关论文
共 50 条
  • [21] Hybrid evolutionary programming using adaptive Levy mutation and modified Nelder-Mead method
    Pang, Jinwei
    He, Jun
    Dong, Hongbin
    SOFT COMPUTING, 2019, 23 (17) : 7913 - 7939
  • [22] Hybrid evolutionary programming using adaptive Lévy mutation and modified Nelder–Mead method
    Jinwei Pang
    Jun He
    Hongbin Dong
    Soft Computing, 2019, 23 : 7913 - 7939
  • [23] Adaptive evolutionary programming with p-best mutation strategy
    Das, Swagatam
    Mallipeddi, Rammohan
    Maity, Dipankar
    SWARM AND EVOLUTIONARY COMPUTATION, 2013, 9 : 58 - 68
  • [24] Cooperative mutation based evolutionary programming for continuous function optimization
    Choi, DH
    OPERATIONS RESEARCH LETTERS, 2002, 30 (03) : 195 - 201
  • [25] A Dual Mutation Strategy Embedded Evolutionary Programming for Continuous Optimization
    Anik, Md Tanvir Alam
    Ahmed, Sabbir
    Noman, Abu Saleh Md
    Islam, K. M. Rakibul
    2013 WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2013, : 84 - 91
  • [26] Mixed Mutation Strategy Evolutionary Programming Based on Shapley Value
    Pang, Jinwei
    Dong, Hongbin
    He, Jun
    Feng, Qi
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 2805 - 2812
  • [27] A Novel Evolutionary Programming for Adaptive Filter Based on Learning Mutation
    Jie, Zhang
    Hui, Ju
    2008 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEM, 2008, : 952 - 954
  • [28] Clustering algorithm using evolutionary programming
    Sarkar, M
    Yegnanarayana, B
    ICNN - 1996 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS, VOLS. 1-4, 1996, : 1162 - 1167
  • [29] Instruction scheduling using evolutionary programming
    Mahajan, Anjali
    Ali, M. S.
    Patil, Mamta
    COMPUTATIONAL METHODS AND APPLIED COMPUTING, 2008, : 137 - +
  • [30] Evolutionary Programming with q-Gaussian Mutation for Dynamic Optimization Problems
    Tinos, Renato
    Yang, Shengxiang
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1823 - +
12345