Multi-swarm hybrid optimization algorithm with prediction strategy for dynamic optimization problems

被引:0
作者
Nie, Wenbo [1 ]
Xu, Lihong [1 ]
机构
[1] Tongji Univ, Coll Elect & Informat Engn, Shanghai, Peoples R China
来源
PROCEEDINGS OF THE 2016 INTERNATIONAL FORUM ON MECHANICAL, CONTROL AND AUTOMATION (IFMCA 2016) | 2017年 / 113卷
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Dynamic optimization algorithm; Particle swarm optimization; Simulated Annealing; Prediction strategy; DIFFERENTIAL EVOLUTION; ENVIRONMENTS;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
It is known that optimization in a changing environment is a challenging task, for which the basic goal is not only to obtain the optimal solution, but also strongly adapting to the environmental changes and tracking the optimal solution as closely as possible. In this paper, a novel multi-swarm optimization algorithm is proposed for solving dynamic optimization problems (DOPs) effectively, which is based on the hybrid of particle swarm optimization (PSO) and Simulated Annealing (SA) with an prediction strategy. Firstly, an multi-swarm strategy is adopted, which simultaneously employs PSO method to conduct global search for exploring promising optimal solutions and adopt SA to conduct local search. Secondly, a new forecasting model is developed by using the principle that the previous optimum locations can predict the optimum's location in the changing environment, which can improve the performance of the algorithm in dynamic environment. Then, a diversity preservation mechanism is incorporated into our method to obtain more robust results. Experiments are conducted on the set of benchmark functions used in CEC 2009 competition for DOPs, and the results show that the proposed algorithm achieves good performance and outperforms others in solving DOPs with the model changed by following some pattern.
引用
收藏
页码:437 / 446
页数:10
相关论文
共 14 条
[1]  
[Anonymous], 2004, The analysis of time series: An introduction
[2]  
Branke J., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1875, DOI 10.1109/CEC.1999.785502
[3]   Differential evolution and differential ant-stigmergy on dynamic optimisation problems [J].
Brest, Janez ;
Korosec, Peter ;
Silc, Jurij ;
Zamuda, Ales ;
Boskovic, Borko ;
Maucec, Mirjam Sepesy .
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2013, 44 (04) :663-679
[4]   Dynamic Optimization using Self-Adaptive Differential Evolution [J].
Brest, Janez ;
Zamuda, Ales ;
Boskovic, Borko ;
Maucec, Mirjam Sepesy ;
Zumer, Viljem .
2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, :415-422
[5]   Optimization in dynamic environments: a survey on problems, methods and measures [J].
Cruz, Carlos ;
Gonzalez, Juan R. ;
Pelta, David A. .
SOFT COMPUTING, 2011, 15 (07) :1427-1448
[6]   GLOBAL OPTIMIZATION OF STATISTICAL FUNCTIONS WITH SIMULATED ANNEALING [J].
GOFFE, WL ;
FERRIER, GD ;
ROGERS, J .
JOURNAL OF ECONOMETRICS, 1994, 60 (1-2) :65-99
[7]   Evolutionary optimization in uncertain environments - A survey [J].
Jin, Y ;
Branke, H .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2005, 9 (03) :303-317
[8]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[9]  
Li C., 2008, TECHNICAL REPORT
[10]  
Liu LL, 2008, LECT NOTES COMPUT SC, V4974, P616