Thumbnail
Access Restriction
Subscribed

Author Ellabaan, M.M.H. ♦ Yew Soon Ong
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2009
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Evolutionary computation ♦ Application software ♦ Evolutionary optimization ♦ Design optimization ♦ Design engineering ♦ Quantum computing ♦ Niching ♦ Quantum mechanics ♦ Lakes ♦ Genetics ♦ Robustness ♦ Intelligent systems ♦ Genetic Algorithms ♦ Multi-modal Optimization
Abstract Recent studies [13, 18] have shown that clearing schemes are efficient multi-modal optimization methods. They efficiently reduce genetic drift which is the direct reason for premature convergence in genetic algorithms. However, clearing schemes assumed a landscape containing equal-spaced basins when using a fixed niche radius. Further, most clearing methods employ policies that favor elitists, thus affecting the explorative capabilities of the search. In this paper, we present a valley adaptive clearing scheme, aiming at adapting to non-uniform width of the valleys in the problem landscape. The framework of the algorithm involves hill-valley initialization, valley-adaptive clearing and archiving. Experimental results on benchmark functions are presented to demonstrate that the proposed scheme uncovers more local optima solutions and displays excellent robustness to varying niche radius than other clearing compeers.
ISBN 9781424447350
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2009-11-30
Publisher Place Italy
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 287.35 kB
Page Count 6
Starting Page 1
Ending Page 6


Source: IEEE Xplore Digital Library