Evolutionary programming using exponential mutation

被引:0
|
作者
Kohmoto, K [1 ]
Narihisa, H [1 ]
Katayama, K [1 ]
机构
[1] Okayama Univ Sci, Fac Engn, Dept Informat & Comp Engn, Okayama 7000005, Japan
关键词
evolutionary programming; evolutionary computation; exponential mutation; function optimization; double exponential distribution;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we present an efficient evolutionary programming with the mutation operator based on double exponential probability distribution concerning the mutation operator of evolutionary programming. There have been proposed various mutation operators by many researchers. However, the mutation operator is mainly based on normal probability distribution or Cauchy probability distribution to evolve solution for given optimization problems. The double exponential probability distribution with one positive real valued parameter has some positive amount variance and is symmetric with respect to origin. Although the variance of this probability distribution is neither infinite as Cauchy distribution, nor unit as standardized normal distribution, the amount of this variance is controllable by the value of this parameter. This fact plays an important role at the evolution process in evolutionary programming. The results of computational experiment show that our proposed evolutionary programming with double exponential probability distribution performs much better than the conventional evolutional programming when applied to the optimization problems which are well known as the benchmark problems in this research field.
引用
收藏
页码:405 / 410
页数:6
相关论文
共 50 条
  • [1] Evolutionary programming with only using exponential mutation
    Narihisa, H.
    Kohmoto, K.
    Taniguchi, T.
    Ohta, M.
    Katayama, K.
    [J]. 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 552 - +
  • [2] Evolutionary programming with exponential mutation
    Narihisa, H
    Taniguchi, T
    Ohta, M
    Katayama, K
    [J]. PROCEEDINGS OF THE NINTH IASTED INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, 2005, : 55 - 60
  • [3] Evolutionary programming using a mixed mutation strategy
    Dong, Hongbin
    He, Jun
    Huang, Houkuan
    Hou, Wei
    [J]. INFORMATION SCIENCES, 2007, 177 (01) : 312 - 327
  • [4] Efficiency of parallel exponential evolutionary programming
    Narihisa, H
    Taniguchi, T
    Thuda, M
    Katayama, K
    [J]. 2005 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, PROCEEDINGS, 2005, : 588 - 595
  • [5] Convergence characteristics of exponential evolutionary programming
    Narihisa, H
    Kohmoto, K
    [J]. PROCEEDINGS OF THE EIGHTH IASTED INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, 2004, : 426 - 431
  • [6] The Two Step Mutation Evolutionary Programming using in Image Segmentation
    Fang, Liu
    [J]. MATERIALS SCIENCE AND INFORMATION TECHNOLOGY, PTS 1-8, 2012, 433-440 : 5459 - 5462
  • [7] A Single Component Mutation Evolutionary Programming
    Ji, Mingjun
    Yang, Hualong
    Yang, Yongzhi
    Jin, Zhihong
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2010, 215 (10) : 3759 - 3768
  • [8] Antenna optimization using an evolutionary programming algorithm with a hybrid mutation operator
    Hoorfar, A
    Liu, Y
    [J]. IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM, VOLS 1-4: TRANSMITTING WAVES OF PROGRESS TO THE NEXT MILLENNIUM, 2000, : 1026 - 1029
  • [9] Evolutionary Programming Using Distribution-Based and Differential Mutation Operators
    Anik, Md. Tanvir Alam
    Ahmed, Saif
    [J]. UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, 2013, 7956 : 244 - 245
  • [10] A single-point mutation evolutionary programming
    Ji, MJ
    Tang, HW
    Guo, J
    [J]. INFORMATION PROCESSING LETTERS, 2004, 90 (06) : 293 - 299