differential evolution using opposite point for global numerical optimization微分进化为全球数值优化使用相反的点.pdfVIP

Journal of Intelligent Learning Systems and Applications, 2012, 4, 1-19 1 / 10.4236/jilsa.2012.41001 Published Online February 2012 (http://www.SciRP.org/journal/jilsa) Differential Evolution Using Opposite Point for Global Numerical Optimization 1 2 Youyun Ao , Hongqin Chi 1School of Computer and Information, Anqing Teachers College, Anqing, China; 2College of Information, Mechanical and Electrical Engineering, Shanghai Normal University, Shanghai, China. Email: youyun_ao@ Received September 25th, 2010; revised May 8th, 2011; accepted May 20th, 2011 ABSTRACT The Differential Evolution (DE) algorithm is arguably one of the most powerful stochastic optimization algorithms, which has been widely applied in various fields. Global numerical optimization is a very important and extremely dif- ficult task in optimization domain, and it is also a great need for many practical applications. This paper proposes an opposition-based DE algorithm for global numerical optimization, which is called GNO2DE. In GNO2DE, firstly, the opposite point method is employed to utilize the existing search space to improve the convergence speed. Secondly, two candidate DE strategies “DE/rand/1/bin” and “DE/current to best/2/bin” are randomly chosen to make the most of their respective advantages to enhance the search ability. In order to reduce the number of control parameters, this algorithm uses an adaptive crossover rate dynamically tuned during the evolutionary process. Finally, it is validated on a set of benchmark test functions for global numerical optimization. Compared with several existing algorithms, the perform- ance of GNO2DE is superior to or not worse than that of these algorithms in terms of final accuracy, convergence speed, and robustness. In addition, we also especially compare the opposition-based