Abstract
Differential Evolution Algorithm (DE) is an intelligent algorithm widely used in recent years. Many scholars have studied DE algorithm from many aspects, such as theory and application. Selection operator using greedy strategy is an important part of DE algorithm. Traditionally thought, the DE selection operator is only a means to maintain effective population evolution of DE. In fact, the DE selection operator also has some capability to optimize. For this reason, this paper constructs some DE variants, and compares the optimization results of them with the standard DE algorithm. Simulation results show that the new algorithm which only using greedy selection can achieve certain optimization results, meanwhile, DE algorithm which removing its greedy selection operator only has poor performance. This proves that DE selection operator has certain optimization capability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
