An ideal tri-population approach for unconstrained optimization and applications

被引:21
作者
Das, Kedar Nath [1 ]
Parouha, Raghav Prasad [1 ]
机构
[1] NIT, Dept Math, Silchar, Assam, India
关键词
Elitism; Non Redundant Search; Unconstrained benchmark functions; PARTICLE SWARM OPTIMIZATION; HYBRID DIFFERENTIAL EVOLUTION; GLOBAL OPTIMIZATION; PSO; ALGORITHM; DISPATCH; DESIGN; MODEL;
D O I
10.1016/j.amc.2015.01.076
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The hybridization of Differential Evolution (DE) and Particle Swarm Optimization (PSO) have been well preferred over their individual effort in solving optimization problems. The way of applying DE and PSO in the hybridization process is a big deal to achieve promising solutions. Recently, they have been used simultaneously (i.e. in parallel) on different sub-populations of the same population, instead of applying them alternatively in series over the generation. An attempt is made in this paper to hybrid DE and PSO in parallel, under a 'tri-population' environment. Initially, the whole population (in increasing order of fitness) is divided into three groups - inferior group, mid group and superior group. Based on their inherent ability, DE is employed in the inferior and superior groups whereas PSO is used in the mid-group. This proposed method is named as DPD as it uses DE-PSO-DE on the sub-populations of the same population. Two more strategies namely Elitism (to retain the best obtained values so far) and Non Redundant Search (to improve the solution quality) have been incorporated in DPD cycle. The paper is designed with three major aims: (i) investigation of suitable DE-mutation strategies to support DPD, (ii) performance comparison of DPD over state-of-the-art algorithms through a set of benchmark functions and (iii) application of DPD to real life problems. Numerical, statistical and graphical analysis in this paper finally concludes the robustness of the proposed DPD. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:666 / 701
页数:36
相关论文
共 56 条
[11]   A hybrid ANFIS model for business failure prediction utilizing particle swarm optimization and subtractive clustering [J].
Chen, Mu-Yen .
INFORMATION SCIENCES, 2013, 220 :180-195
[12]   Bankruptcy prediction in firms with statistical and intelligent techniques and a comparison of evolutionary computation approaches [J].
Chen, Mu-Yen .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2011, 62 (12) :4514-4524
[13]   A memetic model of evolutionary PSO for computational finance applications [J].
Chiam, S. C. ;
Tan, K. C. ;
Mamun, A. M. .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (02) :3695-3711
[14]  
Das S, 2005, GECCO 2005: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOLS 1 AND 2, P177
[15]   Differential Evolution: A Survey of the State-of-the-Art [J].
Das, Swagatam ;
Suganthan, Ponnuthurai Nagaratnam .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (01) :4-31
[16]  
Das S, 2008, STUD COMPUT INTELL, V116, P1, DOI 10.1007/978-3-540-78297-1_1
[17]  
Deep K., 2011, 2011 International Conference on Communication Systems and Network Technologies (CSNT), P614, DOI 10.1109/CSNT.2011.132
[18]  
Deep Kusum, 2009, International Journal of Intelligent Defence Support Systems, V2, P319, DOI 10.1504/IJIDSS.2009.031415
[19]  
Deep K., 2011, P INT C SOCPROS AISC, P31
[20]   A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization [J].
El Dor, Abbas ;
Clerc, Maurice ;
Siarry, Patrick .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 53 (01) :271-295