A binary differential evolution algorithm learning from explored solutions

NEUROCOMPUTING

卷:149

Article

Chen, Yu^1,2  Xie, Weicheng³  Zou, Xiufen² 

[1] Wuhan Univ Technol, Sch Sci, Wuhan 430070, Peoples R China

[2] Wuhan Univ, Sch Math & Stat, Wuhan 430072, Peoples R China

[3] Shenzhen Univ, Sch Comp Sci & Software Engn, Shenzhen Key Lab Spatial Smart Sensing & Serv, Shenzhen 518052, Peoples R China

关键词: Binary differential evolution algorithm;    Convergence in probability;    Renewal metric;    Refinement metric;   

DOI  :  10.1016/j.neucom.2014.07.030

来源: Elsevier

【 摘 要 】

Although real-coded differential evolution (DE) algorithm's can perform well on continuous optimization problems (CoOPs), designing an efficient binary-coded DE algorithm is still a challenging task. Inspired by the learning mechanism in particle swarm optimization (PSO) algorithms, we propose a binary learning differential evolution (BLDE) algorithm that can efficiently locate the global optimal solutions by learning from the last population. Then, we theoretically prove the global convergence of BLDE, and compare it with some existing binary-coded evolutionary algorithms (EAs) via numerical experiments. Numerical results show that BLDE is competitive with the compared EAs. Further study is performed via the change curves of a renewal metric and a refinement metric to investigate why BLDE cannot outperform some compared EM for several selected benchmark problems. Finally, we employ BLDE in solving the unit commitment problem (UCP) in power systems to show its applicability to practical problems. (C) 2014 Elsevier B.V. All rights reserved.

【 授权许可】

Free