Abstract
This paper proposes a novel Two-layer Hierarchical differential evolution (THDE) algorithm to improve the search ability of differential evolution (DE) algorithm. Individuals are separated into bottom layer and top layer. In the bottom layer, individuals are divided into several groups. Modified DE/current-best/1/bin strategy is conducted to produce offspring, where the best individual comes from top layer. In the top layer, modified DE/rand/1/bin strategy is used to update individuals. A set of famous benchmark functions has been used to test and evaluate the performance of the proposed THDE. The experimental results show that the proposed algorithm is better than DE/current-best/1/bin and DE/rand/1/bin and better than or at least comparable to the self-adaptive DE (JDE) and intersect mutation differential evolution algorithm (IMDE) for most functions.
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.
