返回
A binary differential evolution algorithm learning from explored solutions
DOI:10.1016/j.neucom.2014.07.030.png)
摘要
En 中文
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.
Keyword:
Binary differential evolution algorithm
Convergence in probability
Renewal metric
Refinement metric
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Shape reconstruction of a perfectly conducting scatterer using differential evolution and particle swarm optimization使用差分进化和粒子群优化对完美导电的散射体进行形状重建
Hypoglycemic and hepatoprotective effect of angelica dahurica polysaccharide in type 2 diabetic rats
Topology optimization of structures using modified binary differential evolution使用改进的二进制差分进化算法对结构进行拓扑优化

