Computer Science ›› 2018, Vol. 45 ›› Issue (6A): 120-123.

• Intelligent Computing • Previous Articles     Next Articles

Hybrid Particle Swarm Optimization with Multiply Strategies

YU Wei-wei1,XIE Cheng-wang2   

  1. School of Software,Beijing University of Technology,Beijing 100124,China1
    Science Computing and Intelligent Information Processing of Guangxi Higher Education Key Laboratory,Guangxi Teachers Education University,Nanning 530023,China2
  • Online:2018-06-20 Published:2018-08-03

Abstract: A hybrid particle swarm optimization with multiply strategies (HPSO) was proposed to solve the problem of being easy to get into the local optimum and slow convergence speed for particle swarm optimization algorithm(PSO) in dealing with some complicated optimization problems.The HPSO uses the opposition-based learning strategy to genera-te the opposition-based solutions,which enlarges the search range of particle swarm,and enhances the global exploration ability of the algorithm.At the same time,in order to jump out of the local optimum,the HPSO performs Cauchy mutation on some poorer particles to generate individuals that are far from the local optimum,and the differential evolution (DE) mutation is employed to remain individuals to improve the capacity of local exploitation.The above strategies are combined to balance the abilities of global exploration and local exploitation,which are expected to solve some hard optimization problems better.The HPSO and other three well-known PSOs were compared on 10 benchmark test instances experimentally.The results show that the HPSO performs significant advantages over the compared algorithms in the solution accuracy and the convergence speed.

Key words: Opposition-based learning, Particle swam optimization, Cauchy mutation, Differential evolution

CLC Number: 

  • TP301
[1]KENNEDY J,EBERHART R C.Particle Swarm Optimization[C]∥Proc.of The IEEE International Conferenceon Neural Networks.Piscataway:IEEE Press,1995:1942-1948.
[2]TANG L X,WANG X P.A Hybrid Multiobjective Evolutionary Algorithm for Multiobjective Optimization Problems[J].IEEE Trans.on Evolutionary Computation,2013,17(1):20-46.
[3]RAHNAMAYAN S,TIZHOOSH H R,SALAMA M M A.Opposition-based Differential Evolution[J].IEEE Trans. on Evolutionary Computation,2008,12(1):64-79.
[4]谢承旺,王志杰,夏学文.应用档案精英学习和反向学习的多目标进化算法[J].计算机学报,2017,40(3):757-772.
[5]王立平,谢承旺.一种带反向学习机制的自适应烟花爆炸算法[J].计算机科学,2016,43(11A):103-107.
[6]STORN R,PRICE K.Differential evolution:A simple and efficient adaptive scheme for global optimization over Continuous spaces:TR-95-012[R].ICSI,USA,1995.
[7]周新宇,吴志健,王晖,等.一种精英反向学习的粒子群优化算法[J].电子学报,2013,41(8):1647-1652.
[8]YAO X,LIU Y,LIN G M.Evolutionary Programming Made Faster[J].IEEE Trans. on Evolutionary Computation,1999,3(2):82-102.
[9]康岚兰,董文永,田降森.一种自适应柯西变异的反向学习粒子群优化算法[J].计算机科学,2015,42(10):226-230.
[10]池元成,方杰,蔡国飙.基于差分进化和粒子群优化算法的混合优化算法[J].计算机工程与设计,2009,30(12):2963-2980.
[11]谢承旺,许雷,赵怀瑞,等.应用精英反向学习的多目标烟花爆炸算法[J].电子学报,2016,44(5):1180-1188.
[12]胡旺,YEN G G,张鑫.基于Pareto熵的多目标粒子群优化算法[J].软件学报,2014,25(5):1025-1050.
[1] ZHANG Zhi-qiang, LU Xiao-feng, SUI Lian-sheng, LI Jun-huai. Salp Swarm Algorithm with Random Inertia Weight and Differential Mutation Operator [J]. Computer Science, 2020, 47(8): 297-301.
[2] HOU Gai, HE Lang, HUANG Zhang-can, WANG Zhan-zhan, TAN Qing. Pyramid Evolution Strategy Based on Differential Evolution for Solving One-dimensional Cutting Stock Problem [J]. Computer Science, 2020, 47(7): 166-170.
[3] LI Zhang-wei,WANG Liu-jing. Population Distribution-based Self-adaptive Differential Evolution Algorithm [J]. Computer Science, 2020, 47(2): 180-185.
[4] HUO Lin GUO, Ya-rong, QIN Zhi-jian. Crow Search Algorithm with Cauchy Mutation and Adaptive Step Size [J]. Computer Science, 2020, 47(12): 218-225.
[5] WANG Xuan, MAO Ying-chi, XIE Zai-peng, HUANG Qian. Inference Task Offloading Strategy Based on Differential Evolution [J]. Computer Science, 2020, 47(10): 256-262.
[6] DONG Ming-gang,LIU Bao,JING Chao. Multi-objective Differential Evolution Algorithm with Fuzzy Adaptive Ranking-based Mutation [J]. Computer Science, 2019, 46(7): 224-232.
[7] ZHAO Qing-jie, LI Jie, YU Jun-yang, JI Hong-yuan. Bat Optimization Algorithm Based on Dynamically Adaptive Weight and Cauchy Mutation [J]. Computer Science, 2019, 46(6A): 89-92.
[8] NI Hong-jie, PENG Chun-xiang, ZHOU Xiao-gen, YU Li. Differential Evolution Algorithm with Stage-based Strategy Adaption [J]. Computer Science, 2019, 46(6A): 106-110.
[9] XIAO Peng, ZOU De-xuan, ZHANG Qiang. Efficient Dynamic Self-adaptive Differential Evolution Algorithm [J]. Computer Science, 2019, 46(6A): 124-132.
[10] ZHANG Yu-pei, ZHAO Zhi-jin, ZHENG Shi-lian. Cognitive Decision Engine of Hybrid Learning Differential Evolution and Particle Swarm Optimization [J]. Computer Science, 2019, 46(6): 95-101.
[11] ZHAO Yun-tao, CHEN Jing-cheng, LI Wei-gang. Multi-objective Grey Wolf Optimization Hybrid Adaptive Differential Evolution Mechanism [J]. Computer Science, 2019, 46(11A): 83-88.
[12] YANG Xiao-hua, GAO Hai-yun. Improved Bayesian Algorithm Based Automatic Classification Method for Bibliography [J]. Computer Science, 2018, 45(8): 203-207.
[13] ZOU Hua-fu,XIE Cheng-wang,ZHOU Yang-ping,WANG Li-ping. Group Search Optimization with Opposition-based Learning and Differential Evolution [J]. Computer Science, 2018, 45(6A): 124-129.
[14] LI Jun, LUO Yang-kun, LI Bo and LI Qiao-mu. Differential Hybrid Particle Swarm Optimization Algorithm Based on Different Dimensional Variation [J]. Computer Science, 2018, 45(5): 208-214.
[15] JIA Wei, HUA Qing-yi, ZHANG Min-jun, CHEN Rui, JI Xiang and WANG Bo. Mobile Interface Pattern Clustering Algorithm Based on Improved Particle Swarm Optimization [J]. Computer Science, 2018, 45(4): 220-226.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] . [J]. Computer Science, 2018, 1(1): 1 .
[2] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[3] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[4] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[5] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[6] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[7] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[8] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[9] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[10] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .