Population Isolation and Adaptive-Gathering in Evolutionary Computation
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The function of population isolation is stated by the analyzing the domain of attraction of local optimum. The separation among populations and the adaptive-gathering in a population are achieved by local evolution, so the multi-model function optimization is transformed to uni-modal function optimization. Combining with the (μ+1) evolutionary approach based on space ranking that has a swift convergence speed in uni-modal function optimization, the evolutionary algorithm is presented in which populations separate and genther aunction optimization,the evolutionary algorithm is presented in which populations separate and gether automatically according to domanin of attraction,The experimental result is given at the end of the paper.

    Reference
    Related
    Cited by
Get Citation

黄樟灿,陈思多,李亮.演化计算中的种群隔离与自聚集.软件学报,2002,13(4):827-832

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 18,2000
  • Revised:October 16,2000
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063