DocumentCode
2692338
Title
A study on the design issues of Memetic Algorithm
Author
Nguyen, Q.H. ; Ong, Y.S. ; Krasnogor, N.
Author_Institution
Nanyang Technol. Univ., Singapore
fYear
2007
fDate
25-28 Sept. 2007
Firstpage
2390
Lastpage
2397
Abstract
Over the recent years, there has been increasing research activities made on improving the efficacy of memetic algorithm (MA) for solving complex optimization problems. Particularly, these efforts have revealed the success of MA on a wide range of real world problems. MAs not only converge to high quality solutions, but also search more efficiently than their conventional counterparts. Despite the success and surge in interests on MAs, there is still plenty of scope for furthering our understanding on how and why synergy between population- based and individual learning searchers would lead to successful Memetic Algorithms. In this paper we outline several important design issues of Memetic Algorithms and present a systematic study on each. In particular, we conduct extensive experimental studies on the impact of each individual design issue and their relative impacts on memetic search performances by means of three commonly used synthetic problems. From the empirical studies obtained, we attempt to reveal the behaviors of several MA variants to enhance our understandings on MAs.
Keywords
evolutionary computation; complex optimization problems; memetic algorithm; memetic search performances; Algorithm design and analysis; Cultural differences; Design optimization; Evolution (biology); Evolutionary computation; Genetic mutations; Optimization methods; Simulated annealing; Stochastic processes; Surges;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location
Singapore
Print_ISBN
978-1-4244-1339-3
Electronic_ISBN
978-1-4244-1340-9
Type
conf
DOI
10.1109/CEC.2007.4424770
Filename
4424770
Link To Document