Hybridizing Shuffled Frog Leaping and Shuffled Complex Evolution Algorithms Using Local Search Methods

Morteza Alinia Ahandani and Hosein Alavi-Rad
Additional contact information
Morteza Alinia Ahandani: Department of Electrical Engineering, Young Researchers Club, Islamic Azad University, Langaroud Branch, Langaroud, Iran
Hosein Alavi-Rad: Department of Electrical Engineering, Young Researchers Club, Islamic Azad University, Langaroud Branch, Langaroud, Iran

International Journal of Applied Evolutionary Computation (IJAEC), 2014, vol. 5, issue 1, 30-51

Abstract: In this research, a study was carried out to exploit the hybrid schemes combining two classical local search techniques i.e. Nelder–Mead simplex search method and bidirectional random optimization with two meta-heuristic methods i.e. the shuffled frog leaping and the shuffled complex evolution, respectively. In this hybrid methodology, each subset of meta-heuristic algorithms is improved by a hybrid strategy that is combined from evolutionary process of each subset in related algorithm and a local search method. These hybrid algorithms are evaluated on low and high dimensional continuous benchmark functions and the obtained results are compared with their non-hybrid competitors. The obtained results demonstrate that the hybrid algorithm combined from shuffled frog leaping and Nelder–Mead simplex has a better success rate but a higher number of function evaluations on low-dimensional functions than the shuffled frog leaping. Whereas on high-dimensional functions it has a better success rate and a faster performance. Also the hybrid algorithm combined from shuffled complex evolution and bidirectional random optimization obtains a better performance in terms of success rate and function evaluations than shuffled complex evolution on low dimensional functions; whereas on high-dimensional functions, it obtains a better success rate but a slower performance. Also a comparison of our hybrid algorithms with the other evolutionary algorithms reported in the literature confirms our proposed algorithms have the best performance among all compared algorithms.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/ijaec.2014010103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jaec00:v:5:y:2014:i:1:p:30-51

Access Statistics for this article

International Journal of Applied Evolutionary Computation (IJAEC) is currently edited by Sukhpal Singh Gill

More articles in International Journal of Applied Evolutionary Computation (IJAEC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().