Abstract
Most of the hybrid algorithms are produced by combination of a global optimization algorithm with a local search algorithm. In this paper, the focus is on a simple and efficient hybrid algorithm by combining the differential evolution(DE) and the Nelder-Mead simplex(NM) variant for solving global optimization problem. The DE explores the whole search space to find some promising areas and then the NM is entered to exploit optimal solution as accurately as possible. To examine the efficiency of the proposed algorithm, Thenew algorithm are used to some benchmark problems and the results are compared with of other hybrid algorithms. The results show that the proposed algorithm has superior performance in solving global optimization problems.
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.
