Abstract

This paper presents a hybrid differential evolution (DE) algorithm based on chaos and generalized opposition-based learning (GOBL). In this algorithm, GOBL strategy transforms current search space into a new search space with a random probability, which provides more opportunities for the algorithm to find the global optimum. When the GOBL strategy isn't executed, the chaotic operator, like a mutation operator, will be introduced to help the DE to jump out local optima and improve the global convergence rate. Simulation results show that this hybrid DE algorithm can electively enhance the searching efficiency and greatly improve the searching quality.

Full Text
Published version (Free)

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 call