Improving differential evolution through a unified approach

被引:0
作者
Nikhil Padhye
Piyush Bhardawaj
Kalyanmoy Deb
机构
[1] Massachusetts Institute of Technology,Department of Mechanical Engineering
[2] Indian Institute of Technology Kanpur,Department of Mechanical Engineering
来源
Journal of Global Optimization | 2013年 / 55卷
关键词
Evolutionary computation; Optimization; Genetic algorithms; Differential evolution; Computational complexity;
D O I
暂无
中图分类号
学科分类号
摘要
Only a few attempts in past have been made in adopting a unified outlook towards different paradigms in evolutionary computation (EC). The underlying motivation of these studies was aimed at gaining better understanding of evolutionary methods, both at the level of theory as well as application, in order to design efficient evolutionary algorithms for solving wide-range of complex problems. However, the past descriptions have either been too general or sometimes abstract in issuing a clear direction for improving an evolutionary paradigm for a task-specific. This paper recollects the ‘Unified Theory of Evolutionary Computation’ from past and investigates four steps—Initialization, Selection, Generation and Replacement, which are sufficient to describe traditional forms of Evolutionary Optimization Systems such as Genetic Algorithms, Evolutionary Strategies, Evolutionary Programming, Particle Swarm Optimization and differential evolution (DE). Then, a relatively new evolutionary paradigm, DE, is chosen and studied for its performance on a set of unimodal problems. Discovering DEs inability as an efficient solver, DE is reviewed under ‘Unified Framework’ and functional requirements of each step are evaluated. Targeted towards enhancing the DE’s performance, several modifications are proposed through borrowing of operations from a benchmark solver G3-PCX. Success of this exercise is demonstrated in a step-by-step fashion via simulation results. The Unified Approach is highly helpful in understanding the role and re-modeling of DE steps in order to efficiently solve unimodal problems. In an avalanching-age of new methods in EC, this study outlines a direction for advancing EC methods by undertaking a collective outlook and an approach of concept-sharing.
引用
收藏
页码:771 / 799
页数:28
相关论文
共 26 条
  • [1] Ahrari A.(2010)On the utility of randomly generated functions for performance evaluation of evolutionary algorithms Optim. Lett. 4 531-541
  • [2] Ahrari R.(2004)Population set based global optimization algorithms: some modifications and numerical studies Comput. Oper. Res. 31 1703-1725
  • [3] Ali M.M.(1995)Department of Computer Science: Toward a theory of evolution strategies: self-adaptation Evol. Comput. 3 311-347
  • [4] Törn A.(2006)Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems IEEE Trans. Evol. Comput. 6 646-657
  • [5] Beyer H.-G.(2002)A computationally efficient evolutionary algorithm for real-parameter optimization Evol. Comput. 10 371-395
  • [6] Brest J.(2001)Completely derandomized self-adaptation in evolution strategies Evol. Comput. 9 159-195
  • [7] Greiner S.(2007)Global optimization by continuous grasp Optim. Lett. 1 201-212
  • [8] Boskovic B.(2005)A fuzzy adaptive differential evolution algorithm Soft Comput. Fusion Found. Methodol. Appl. 9 448-462
  • [9] Mernik M.(2009)Differential evolution algorithm with strategy adaptation for globalnumerical optimization IEEE Trans. Evol. Comput. 13 398-417
  • [10] Zumer V.(1997)Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces J. Glob. Optim. 11 341-359