A novel hybrid adaptive collaborative approach based on particle swarm optimization and local search for dynamic optimization problems

被引:31
作者
Sharifi, Ali [1 ]
Kordestani, Javidan Kazemi [2 ]
Mandaviani, Mahshid [1 ]
Meybodi, Mohammad Reza [1 ]
机构
[1] Amirkabir Univ Technol, Tehran Polytech, Soft Comp Lab, Comp Engn & Informat Technol Dept, Tehran, Iran
[2] Islamic Azad Univ, Sci & Res Branch, Dept Comp Engn, Tehran, Iran
关键词
Dynamic optimization problems; Moving peaks benchmark; DOPs; MPB; Particle swarm optimizer; Naive direct search; ALGORITHM; OPTIMA; MODEL; ENVIRONMENTS;
D O I
10.1016/j.asoc.2015.04.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a novel hybrid approach based on particle swarm optimization and local search, named PSOLS, for dynamic optimization problems. In the proposed approach, a swarm of particles with fuzzy social-only model is frequently applied to estimate the location of the peaks in the problem landscape. Upon convergence of the swarm to previously undetected positions in the search space, a local search agent (LSA) is created to exploit the respective region. Moreover, a density control mechanism is introduced to prevent too many LSAs crowding in the search space. Three adaptations to the basic approach are then proposed to manage the function evaluations in the way that are mostly allocated to the most promising areas of the search space. The first adapted algorithm, called HPSOLS, is aimed at improving PSOLS by stopping the local search in LSAs that are not contributing much to the search process. The second adapted, algorithm called CPSOLS, is a competitive algorithm which allocates extra function evaluations to the best performing LSA. The third adapted algorithm, called CHPSOLS, combines the fundamental ideas of HPSOLS and CPSOLS in a single algorithm. An extensive set of experiments is conducted on a variety of dynamic environments, generated by the moving peaks benchmark, to evaluate the performance of the proposed approach. Results are also compared with those of other state-of-the art algorithms from the literature. The experimental results indicate the superiority of the proposed approach. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:432 / 448
页数:17
相关论文
共 53 条
[1]   Research on particle swarm optimization based clustering: A systematic review of literature and techniques [J].
Alam, Shafiq ;
Dobbie, Gillian ;
Koh, Yun Sing ;
Riddle, Patricia ;
Rehman, Saeed Ur .
SWARM AND EVOLUTIONARY COMPUTATION, 2014, 17 :1-13
[2]  
[Anonymous], 2002, P GEN EV COMP C
[3]  
[Anonymous], P 4 INT S COMP INT D
[4]  
Arnold DV, 2002, IEEE T EVOLUT COMPUT, V6, P30, DOI [10.1109/4235.985690, 10.1023/A:1015059928466]
[5]  
Blackwell T., 2007, Particle Swarm Optimization in Dynamic Environments, P29
[6]   Multiswarms, exclusion, and anti-convergence in dynamic environments [J].
Blackwell, Tim ;
Branke, Juergen .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (04) :459-472
[7]  
Blackwell Tim, 2008, P193, DOI 10.1007/978-3-540-74089-6_6
[8]  
Blackwell TM, 2002, IEEE C EVOL COMPUTAT, P1691, DOI 10.1109/CEC.2002.1004497
[9]  
Branke J., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1875, DOI 10.1109/CEC.1999.785502
[10]  
Branke Jurgen., 2002, Evolutionary Optimization in Dynamic Environments