Self-learning differential evolution algorithm for dynamic polycentric problems

A novel self-learning differential evolution algorithm is proposed to solve dynamical multi-center optimization problems.The approach of re-evaluating some specific individuals is used to monitor environmental changes.The proposed self-learning operator guides the evolutionary group to a new environ...

Full description

Saved in:
Bibliographic Details
Main Authors: Xing-bao LIU, Jian-ping YIN, Chun-hua HU, Rong-yuan CHEN
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2015-07-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015154/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A novel self-learning differential evolution algorithm is proposed to solve dynamical multi-center optimization problems.The approach of re-evaluating some specific individuals is used to monitor environmental changes.The proposed self-learning operator guides the evolutionary group to a new environment,meanwhile maintains the stable topology structure of group to maintain the current evolutionary trend.A neighborhood search mechanism and a random immigrant mechanism are adapted to make a tradeoff between algorithmic convergence and population diversity.The experiment studies on a periodic dynamic function set suits are done,and the comparisons with peer algorithms show that the self-learning differential algorithm outperforms other algorithms in term of convergence and adaptability under dynamical environment.
ISSN:1000-436X