An efficient differential evolution algorithm for function optimization

被引:1
作者
Wang, Chao-Xue [1 ]
Li, Chang-Hua [1 ]
Dong, Hui [1 ]
Zhang, Fan [1 ]
机构
[1] School of Information and Control Engineering, Xi'an University of Architecture and Technology
关键词
Affinity matrix; Differential evolution algorithm; Function optimization; Normal distribution; Roulette wheel selection;
D O I
10.3923/itj.2013.444.448
中图分类号
学科分类号
摘要
An efficient differential evolution algorithm (AEDE) for function optimization is proposed. First, with population evolution, AEDE divides population into three groups by the fitness's normal distribution and the three groups adopt different mutation operators. Second, the selection of the individuals involved m mutation operation uses alternatively a random method and a roulette wheel method based on affinity matrix. To validate the superiority of AEDE, AEDE and some state-of-the-art DE variants proposed in pertinent literatures are compared as regards nine benchmark functions. The simulation results show that ANDE promises competitive performance not only in the convergence speed but also in the quality of solution. © 2013 Asian Network for Scientific Information.
引用
收藏
页码:444 / 448
页数:4
相关论文
共 15 条
  • [1] Das S., Suganthan P.N., Differential evolution: A survey of the State-of-the-art, IEEE Trans. Evol. Comput, 15, pp. 4-31, (2011)
  • [2] Epitropakis M.G., Tasoulis D.K., Pavlidis N.G., Plagianakos V.P., Vrahatis M.N., Enhancing differential evolution utilizing Proximity-based mutation operators, IEEE Trans. Evol. Comput., 15, pp. 99-119, (2011)
  • [3] Epitropakis M.G., Plagianakos V.P., Vrahatis M.N., Balancing the exploration and exploitation capabilities of the differential evolution algorithm, Proceedings of the IEEE Congress on Evolutionary Computation, pp. 2686-2693, (2008)
  • [4] Macready W.G., Wolpert II D.H., Bandit problems and the exploration/exploitation tradeoff, IEEE Trans. Evol. Comput, 2, pp. 2-22, (1998)
  • [5] Mininno E., Neri F., Cupertino F., Naso D., Compact differential evolution, IEEE Trans. Evol. Comput., 15, pp. 32-54, (2011)
  • [6] Montgomery J., Chen S., An analysis of the operation of differential evolution at high and low crossover rates, Proceedings Of The IEEE Congress on Evolutionary Computation, pp. 1-8, (2010)
  • [7] Noman N., Iba H., Accelerating differential evolution using an adaptive local search, IEEE Trans. Evol. Comput, 12, pp. 107-125, (2008)
  • [8] Price K.V., Storn R.M., Lampinen J.A., Differential Evolution: A Practical Approach to Global Optimization., (2005)
  • [9] Qm A.K., Suganthan P.N., Self-adaptive differential evolution algorithm for numerical optimization, Proc. IEEE Cong. Evol. Comput, 2, pp. 1785-1791, (2005)
  • [10] Storn R., Price K., Differential Evolution: A Simple and Efficient Adaptive Scheme for Global Optimization Over Continuous Spaces, (1995)