Globally-optimal prediction-based adaptive mutation particle swarm optimization

被引:22
|
作者
Cui, Quanlong [1 ,2 ]
Li, Qiuying [1 ,6 ]
Li, Gaoyang [1 ,2 ]
Li, Zhengguang [3 ]
Han, Xiaosong [1 ,2 ]
Lee, Heow Pueh [5 ]
Liang, Yanchun [1 ,2 ,4 ]
Wang, Binghong [7 ]
Jiang, Jingqing [8 ]
Wu, Chunguo [1 ,2 ,4 ]
机构
[1] Jilin Univ, Key Lab Symbol Computat & Knowledge Engn, Minist Educ, Changchun 130012, Jilin, Peoples R China
[2] Jilin Univ, Coll Comp Sci & Technol, Qjanjin St 2699, Changchun, Jilin, Peoples R China
[3] Jilin Univ, Math Sch & Inst, Qjanjin St 2699, Changchun, Jilin, Peoples R China
[4] Jilin Univ, Minist Educ, Zhuhai Coll, Zhuhai Lab,Key Lab Symbol Computat & Knowledge En, Zhuhai 519041, Peoples R China
[5] Natl Univ Singapore, Dept Mech Engn, 10 Kent Ridge Crescent, Singapore 119260, Singapore
[6] Beijing Publ Transport Holdings Grp Co Ltd, 29 Lian Hua Chi Xi Li, Beijing, Peoples R China
[7] Univ Sci & Technol China, Dept Modern Phys, Hefei 230026, Anhui, Peoples R China
[8] Inner Mongolia Univ Nationalities, Coll Comp Sci & Technol, Tongliao 028043, Peoples R China
基金
中国国家自然科学基金;
关键词
Adaptivity; Function fitting; Global prediction; Non-uniform mutation; Particle swarm optimization; ALGORITHM;
D O I
10.1016/j.ins.2017.07.038
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Particle swarm optimizations (PSOs) are drawing extensive attention from both research and engineering fields due to their simplicity and powerful global search ability. However, there are two issues needing to be improved: one is that the classical PSO converges slowly; the other is that classical PSO tends to result in premature convergence, especially for multi-modal problems. This paper attempts to address these two issues. Firstly, to improve the convergent efficiency, this paper proposes an asymptotic predicting model of the globally-optimal solution, which is used to predict the global optimum based on extracting the features reflecting the evolutionary trend. The predicted global optimum is then taken as the third exemplar, in a way similar to the individual historical best solution and the swarm historical best solution in guiding the evolutionary process of other particles. To reduce the probability that the population is trapped into a local optimum due to the premature phenomenon, this paper proposes an adaptive mutation strategy, which is used to help the trapped particles to escape away from the local optimum by using the extended non-uniform mutation operator. Finally, we combine the two entities to develop a globally-optimal prediction-based adaptive mutation particle swarm optimization (GPAM-PSO). In numerical experimental parts, we compare the proposed GPAM-PSO with 11 existing PSO variants by using 22 benchmark problems of 30-dimensions and 100-dimensions, respectively. Numerical experiments demonstrate that the proposed GPAM-PSO could improve the accuracy and efficiency remarkably, which means that the combination of the globally-optimal prediction-based search and the adaptive mutation strategy could accelerate the convergence and reduce premature phenomenon effectively. Generally speaking, GPAM-PSO performs most efficiently and robustly. Moreover, the performance on an engineering problem demonstrates the practical application of the proposed GPAM-PSO algorithm. (C) 2017 The Authors. Published by Elsevier Inc.
引用
收藏
页码:186 / 217
页数:32
相关论文
共 50 条
  • [1] Global Prediction-Based Adaptive Mutation Particle Swarm Optimization
    Li, Qiuying
    Li, Gaoyang
    Han, Xiaosong
    Zhang, Jianping
    Liang, Yanchun
    Wang, Binghong
    Li, Hong
    Yang, Jinyu
    Wu, Chunguo
    2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 268 - 273
  • [2] Particle Swarm Optimization with Adaptive Mutation
    Tang, Jun
    Zhao, Xiaojuan
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 234 - 237
  • [3] Adaptive Particle Swarm Optimization with Mutation
    Xu Dong
    Li Ye
    Tang Xudong
    Pang Yongjie
    Liao Yulei
    2011 30TH CHINESE CONTROL CONFERENCE (CCC), 2011, : 2044 - 2049
  • [4] A Particle Swarm Optimization Algorithm Based on Adaptive Periodic Mutation
    Li, Xiaohu
    Zhuang, Jian
    Wang, Sunan
    Zhang, Yulin
    ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 1, PROCEEDINGS, 2008, : 150 - 155
  • [5] Adaptive Mutation Opposition-Based Particle Swarm Optimization
    Kang, Lanlan
    Dong, Wenyong
    Li, Kangshun
    COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS, (ISICA 2015), 2016, 575 : 116 - 128
  • [6] Particle swarm optimization with adaptive mutation for multimodal optimization
    Wang, Hui
    Wang, Wenjun
    Wu, Zhijian
    APPLIED MATHEMATICS AND COMPUTATION, 2013, 221 : 296 - 305
  • [7] Particle Swarm Optimization with Adaptive Mutation Operator
    Chen, Yujuan
    DCABES 2008 PROCEEDINGS, VOLS I AND II, 2008, : 710 - 713
  • [8] Particle Swarm Optimization using adaptive mutation
    Pant, Millie
    Thangaraj, Radha
    Abraham, Ajith
    DEXA 2008: 19TH INTERNATIONAL CONFERENCE ON DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2008, : 519 - +
  • [9] Application and Parameters Optimization of SVM Based on Adaptive Mutation Particle Swarm Optimization
    Wang, Xiaodong
    Li, Mi
    Lu, Shengfu
    Zhong, Ning
    2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING APPLICATIONS (CSEA 2015), 2015, : 665 - 669
  • [10] Opposition-based particle swarm optimization with adaptive mutation strategy
    Wenyong Dong
    Lanlan Kang
    Wensheng Zhang
    Soft Computing, 2017, 21 : 5081 - 5090