An angular distance dependent alternation model for real-coded genetic algorithms

被引:1
作者
Takahashi, O [1 ]
Kobayashi, S [1 ]
机构
[1] Tokyo Inst Technol, Dept Computat Inteligence & Syst Sci, Grad Sch Interdisciplinary Sci & Engn, Midori Ku, Yokohama, Kanagawa 2268502, Japan
来源
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2 | 2004年
关键词
D O I
10.1109/CEC.2004.1331164
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
When we use genetic algorithms to solve any type of problems, it is important to maintain the diversity of populations for avoiding early stage stagnation or falling into local minima. We propose an angular distance dependent alternation (ADDA) model as a generation alternation model on real-coded genetic algorithms (GA) to improve its performance by maintaining adequate diversity of populations. The basic concept of the ADDA is that all of offspring generated by crossover operations will be clustered by a corresponding parent based on the angular distance metric and will be transposed from the parent. We compare performance of the proposed alternation model with previous family based Minimal Generation Gap (MGG) model and Distance Dependent Alternation (DDA) model. Using with the multi-parental Unimodal Normal Distribution Crossover (UNDX-m), the ADDA model shows good performance on three typical benchmark problems.
引用
收藏
页码:2159 / 2165
页数:7
相关论文
共 10 条
  • [1] [Anonymous], 1989, GENETIC ALGORITHM SE
  • [2] Back T., 1996, EVOLUTIONARY ALGORIT
  • [3] Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms
    Kita, H
    Ono, I
    Kobayashi, S
    [J]. 1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 529 - 534
  • [4] Kita H., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1581, DOI 10.1109/CEC.1999.782672
  • [5] Ono I, 1997, P 7 INT C GEN ALG, P246
  • [6] SATOH H, 1996, P IIZUKA 96, P494
  • [7] Satoh H, 1997, P 4 INT C SOFT COMP, P494
  • [8] Schwefel H.-P., 1995, EVOLUTION OPTIMUM SE
  • [9] TAKAHASHI O, 1999, 1999 IEEE INT C SYST, P619
  • [10] TAKAHASHI O, 2000, P GEN EV COMP C GECC, P219