Disturbed Exploitation compact Differential Evolution for limited memory optimization problems

被引:102
作者
Neri, Ferrante [1 ]
Iacca, Giovanni [1 ]
Mininno, Ernesto [1 ]
机构
[1] Univ Jyvaskyla, Dept Math Informat Technol, Jyvaskyla 40014, Finland
基金
芬兰科学院;
关键词
Differential Evolution; Evolutionary algorithms; Compact algorithms; Memetic Computing; MEMETIC ALGORITHMS; GENETIC ALGORITHMS; DESIGN; SEARCH;
D O I
10.1016/j.ins.2011.02.004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local search algorithms, employs multiple exploitative search within the main framework and performs a multiple step global search by means of a randomized perturbation of the virtual population corresponding to a periodical randomization of the search for the exploitative operators. The proposed Memetic Computing approach is based on a populationless (compact) evolutionary framework which, instead of processing a population of solutions, handles its statistical model. This evolutionary framework is based on a Differential Evolution which cooperatively employs two exploitative search operators: the first is based on a standard Differential Evolution mutation and exponential crossover, and the second is the trigonometric mutation. These two search operators have an exploitative action on the algorithmic framework and thus contribute to the rapid convergence of the virtual population towards promising candidate solutions. The action of these search operators is counterbalanced by a periodical stochastic perturbation of the virtual population, which has the role of "disturbing" the excessively exploitative action of the framework and thus inhibits its premature convergence. The proposed algorithm, namely Disturbed Exploitation compact Differential Evolution, is a simple and memory-wise cheap structure that makes use of the Memetic Computing paradigm in order to solve complex optimization problems. The proposed approach has been tested on a set of various test problems and compared with state-of-the-art compact algorithms and with some modern population based meta-heuristics. Numerical results show that Disturbed Exploitation compact Differential Evolution significantly outperforms all the other compact algorithms present in literature and reaches a competitive performance with respect to modern population algorithms, including some memetic approaches and complex modern Differential Evolution based algorithms. In order to show the potential of the proposed approach in real-world applications, Disturbed Exploitation compact Differential Evolution has been implemented for performing the control of a space robot by simulating the implementation within the robot micro-controller. Numerical results show the superiority of the proposed algorithm with respect to other modern compact algorithms present in literature. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:2469 / 2487
页数:19
相关论文
共 81 条
[1]  
ABRAMOWITZ M, 1972, HDB MATH FUNCTIONS, P297
[2]  
Ahn C.W., INFORM SCI IN PRESS
[3]   Elitism-based compact genetic algorithms [J].
Ahn, CW ;
Ramakrishna, RS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (04) :367-385
[4]  
[Anonymous], 2004, RECENT ADV MEMETIC A, DOI DOI 10.1007/3-540-32363-59
[5]  
[Anonymous], 2006, SCALABLE OPTIMIZATIO
[6]  
[Anonymous], NEW IDEAS OPTIMIZATI
[7]  
[Anonymous], 2001, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
[8]  
[Anonymous], INFORM SCI IN PRESS
[9]  
[Anonymous], 1989, COMPETITIVE COOPERAT
[10]  
Aporntewan C, 2001, IEEE C EVOL COMPUTAT, P624, DOI 10.1109/CEC.2001.934449