摘要
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.
学科与关键词
- Modified Binary Differential Evolution Algorithm to Solve Unit Commitment ProblemDhaliwal, Jatinder Singh*; Dhillon, Jaspreet SinghELECTRIC POWER COMPONENTS AND SYSTEMS, 2018, 46(8): 900-918.被引 16
- A synergy of binary differential evolution and binary local search optimizer to solve multi-objective profit based unit commitment problemDhaliwal, Jatinder Singh*; Dhillon, J. S.APPLIED SOFT COMPUTING, 2021, 107: 107387.被引 17
- Binary whale optimization algorithm and its application to unit commitment problemKumar, Vijay*; Kumar, DineshNEURAL COMPUTING & APPLICATIONS, 2020, 32(7): 2095-2123.被引 50
