• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Dou Quansheng, Zhou Chunguang, and Ma Ming. Two Improvement Strategies for Particle Swarm Optimization[J]. Journal of Computer Research and Development, 2005, 42(5): 897-904.
Citation: Dou Quansheng, Zhou Chunguang, and Ma Ming. Two Improvement Strategies for Particle Swarm Optimization[J]. Journal of Computer Research and Development, 2005, 42(5): 897-904.

Two Improvement Strategies for Particle Swarm Optimization

More Information
  • Published Date: May 14, 2005
  • Particle swarm optimization (PSO) method was proposed by Kennedy and Eberhart in 1995, which can be used to solve a wide array of different optimization problem. The PSO idea is inspired by natural concepts such as fish schooling, bird floc king and human social relations. Some experimental results show that PSO has gre ater “global search” ability, but the “local search” ability around the opti mum is not very good. In order to enhance the “local search” ability of the traditional PSO, two improvement methods for the PSO, that is, PSO with simulated annealing (PSOwSA) and PSO with division of work (PSOwDOW), are introduced by analyzing deeply the traditional PSO. Experiments for several benchmark problems s how that PSOwSA and PSOwDOW can overcome the fault of traditional PSO and increa se the optimization power of the particle swarm.
  • Related Articles

    [1]Li Chen, Chen Yidong, Lu Zhonghua, Yang Xueying, Wang Zitian, Chi Xuebin. A Parallel Multi-Objective Dividing Rectangles Algorithm Based on Normalized Decomposition[J]. Journal of Computer Research and Development, 2024, 61(11): 2909-2922. DOI: 10.7544/issn1000-1239.202330093
    [2]Liu Quan, Fu Qiming, Yang Xudong, Jing Ling, Li Jin, Li Jiao. A Scalable Parallel Reinforcement Learning Method Based on Intelligent Scheduling[J]. Journal of Computer Research and Development, 2013, 50(4): 843-851.
    [3]Zhou Hanxun, Zhao Hong, Wen Yingyou. Modeling and Analysis of Divide-and-Rule-Hybrid-Benign Worms[J]. Journal of Computer Research and Development, 2009, 46(7): 1110-1116.
    [4]Li Jianfu, Guo Maozu, and Liu Yang. An Evolutionary Tree Reconstruction Method Combining Quartet Puzzling and Neighbor Joining[J]. Journal of Computer Research and Development, 2008, 45(11): 1965-1973.
    [5]Li Kenli, Liu Jie, Yang Lei, Liu Wenbin. An O(1.414\+n) Volume Molecular Solutions for the Exact Cover Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2008, 45(10): 1782-1788.
    [6]Wang Li, Zhang Suwei, Li Zhansheng, Song Linjian. A Multi-Path Routing Protocol Based on Divide and Conquer Strategy in Ad Hoc Network[J]. Journal of Computer Research and Development, 2008, 45(1).
    [7]Lin Jiao, Wang Shanying, Wang Chongyu. A Study of Parallel DVM-DAC Algorithm in Multiscale Physics[J]. Journal of Computer Research and Development, 2007, 44(10): 1667-1672.
    [8]Li Kenli, Yao Fengjuan, Li Renfa, Xu Jin. Improved Molecular Solutions for the Knapsack Problem on DNA-Based Supercomputing[J]. Journal of Computer Research and Development, 2007, 44(6): 1063-1070.
    [9]He Lijian and Zhang Wei. An Agent Organization Structure for Solving DCOP Based on the Partitions of Constraint Graph[J]. Journal of Computer Research and Development, 2007, 44(3).
    [10]Hou Yuexian, Ding Zheng, and He Pilian. Self-Organizing Isometric Embedding[J]. Journal of Computer Research and Development, 2005, 42(2): 188-195.

Catalog

    Article views (633) PDF downloads (694) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return