Investigating Smart Sampling as a population initialization method for Differential Evolution in continuous problems

被引:38
作者
de Melo, Vinicius Veloso [1 ]
Botazzo Delbem, Alexandre Claudio [2 ]
机构
[1] Univ Fed Sao Paulo, Inst Sci & Technol, Sao Jose Dos Campos, SP, Brazil
[2] Univ Sao Paulo, Lab Reconfigurable Comp, Sao Carlos, SP, Brazil
关键词
Metaheuristic; Smart Sampling; Promising region; Population initialization; Differential Evolution; Global Optimization; GLOBAL OPTIMIZATION; ALGORITHMS; OPPOSITION; UEGO;
D O I
10.1016/j.ins.2011.12.037
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, researches have shown that the performance of metaheuristics can be affected by population initialization. Opposition-based Differential Evolution (ODE), Quasi-Oppositional Differential Evolution (QODE), and Uniform-Quasi-Opposition Differential Evolution (UQODE) are three state-of-the-art methods that improve the performance of the Differential Evolution algorithm based on population initialization and different search strategies. In a different approach to achieve similar results, this paper presents a technique to discover promising regions in a continuous search-space of an optimization problem. Using machine-learning techniques, the algorithm named Smart Sampling (SS) finds regions with high possibility of containing a global optimum. Next, a metaheuristic can be initialized inside each region to find that optimum. SS and DE were combined (originating the SSDE algorithm) to evaluate our approach, and experiments were conducted in the same set of benchmark functions used by ODE, QODE and UQODE authors. Results have shown that the total number of function evaluations required by DE to reach the global optimum can be significantly reduced and that the success rate improves if SS is employed first. Such results are also in consonance with results from the literature, stating the importance of an adequate starting population. Moreover, SS presents better efficacy to find initial populations of superior quality when compared to the other three algorithms that employ oppositional learning. Finally and most important, the SS performance in finding promising regions is independent of the employed metaheuristic with which SS is combined, making SS suitable to improve the performance of a large variety of optimization techniques. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:36 / 53
页数:18
相关论文
共 46 条
[1]  
AHA DW, 1991, MACH LEARN, V6, P37, DOI 10.1007/BF00153759
[2]  
[Anonymous], 1997, Journal of Global Optimization, DOI DOI 10.1023/A:1008202821328
[3]  
Back T., 1997, HDB EVOLUTIONARY COM
[4]  
Box G.E., 1978, STAT EXPT
[5]   Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions [J].
Chelouah, R ;
Siarry, P .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 148 (02) :335-348
[6]  
Cohen W.W., 1995, P 12 INT C MACH LEAR, P115, DOI [10.1016/b978-1-55860-377-6.50023-2, DOI 10.1016/B978-1-55860-377-6.50023-2]
[7]   A synthesis system for analog circuits based on evolutionary search and topological reuse [J].
Dastidar, TR ;
Chakrabarti, PP ;
Ray, P .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2005, 9 (02) :211-224
[8]  
de Melo VV, 2007, LECT NOTES ARTIF INT, V4827, P72
[9]  
DEB K, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P42
[10]  
Gabriel PHR, 2009, LECT N BIOINFORMAT, V5676, P97, DOI 10.1007/978-3-642-03223-3_9