Diversity Guided Evolutionary Programming: A novel approach for continuous optimization

被引:18
作者
Alam, Mohammad Shafiul [1 ]
Islam, Md. Monirul [1 ]
Yao, Xin [2 ,3 ]
Murase, Kazuyuki [4 ]
机构
[1] Bangladesh Univ Engn & Technol, Dept Comp Sci & Engn, Dhaka 1000, Bangladesh
[2] Univ Sci & Technol China, Dept Comp Sci, Nat Inspired Computat & Applicat Lab, Hefei 230027, Anhui, Peoples R China
[3] Univ Birmingham, Sch Comp Sci, CERCIA, Birmingham B15 2TT, W Midlands, England
[4] Univ Fukui, Dept Human & Artificial Intelligence Syst, Fukui 9108507, Japan
关键词
Evolutionary programming; Population diversity; Exploitation and exploration; Continuous optimization; GENETIC ALGORITHM;
D O I
10.1016/j.asoc.2012.02.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Avoiding premature convergence to local optima and rapid convergence towards global optima has been the major concern with evolutionary systems research. In order to avoid premature convergence, sufficient amount of genetic diversity within the evolving population is considered necessary. Several studies have focused to devise techniques to control and preserve population diversity throughout the evolution. Since mutation is the major operator in many evolutionary systems, such as evolutionary programming and evolutionary strategies, a significant amount of research has also been done for the elegant control and adaptation of the mutation step size that is proper for traversing across the locally optimum points and reach for the global optima. This paper introduces Diversity Guided Evolutionary Programming, a novel approach to combine the best of both these research directions. This scheme incorporates diversity guided mutation, an innovative mutation scheme that guides the mutation step size using the population diversity information. It also takes some extra diversity preservative measures to maintain adequate amount of population diversity in order to assist the proposed mutation scheme. An extensive simulation has been done on a wide range of benchmark numeric optimization problems and the results have been compared with a number of recent evolutionary systems. Experimental results show that the performance of the proposed system is often better than most other algorithms in comparison on most of the problems. (C) 2012 Elsevier B. V. All rights reserved.
引用
收藏
页码:1693 / 1707
页数:15
相关论文
共 68 条
[1]   Evolutionary learning of hierarchical decision rules [J].
Aguilar-Ruiz, JS ;
Riquelme, JC ;
Toro, M .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2003, 33 (02) :324-331
[2]  
[Anonymous], 1995, THESIS CITESEER
[3]  
[Anonymous], PARALLEL PROBLEM SOL
[4]  
[Anonymous], 1973, Evolutions Strategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution Stuttgart
[5]  
[Anonymous], PARALLEL PROBLEM SOL
[6]  
[Anonymous], 92004 ILLIGAL
[7]  
[Anonymous], 1975, ANAL BEHAV CLASS GEN
[8]  
[Anonymous], 1975, Ann Arbor
[9]  
Back T., 1992, Toward a Practice of Autonomous Systems. Proceedings of the First European Conference on Artificial Life, P263
[10]  
Back T., 1997, HDB EVOLUTIONARY COM