Skip to main content

A Cooperative Particle Swarm Optimization Algorithm Based on Greedy Disturbance

  • Conference paper
  • First Online:
Pattern Recognition and Computer Vision (PRCV 2019)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 11859))

Included in the following conference series:

  • 1810 Accesses

Abstract

In this paper, an improved Particle Swarm Optimization Algorithm (GCPSO) is proposed to solve the shortcomings of the existing Particle Swarm Optimization Algorithm (PSO) which has low convergence precision, slow convergence rate and is easy to fall into local optimum when performing high-dimensional optimization in the late iteration. First, the whole particle swarm of the algorithm was divided into three sub-groups, and different ranges of inertia weight ω are set for balances global search and local search in each sub-group, which improves the algorithm’s ability to explore. Then we add Gaussian perturbation with the greedy strategy to PSO to avoid the algorithm falling into local optimum and improve the convergence speed. And finally, the proposed algorithm is compared with Genetic Algorithm (GA), PSO and Grasshopper Optimization Algorithm (GOA) to analyse its performance and speed. Through experimental analysis, GCPSO has a significant improvement at convergence speed, convergence accuracy and stability.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hammouche, K., Diaf, M., Siarry, P.: A multilevel automatic thresholding method based on a genetic algorithm for a fast image segmentation. Comput. Vis. Image Underst. 109(2), 163–175 (2008)

    Article  Google Scholar 

  2. Sathya, P.D., Kayalvizhi, R.: PSO-based Tsallis thresholding selection procedure for image segmentation. Int. J. Comput. Appl. 5(4), 39–46 (2010)

    Google Scholar 

  3. Sharma, A., Sharma, M., Rajneesh: SAR image segmentation using Grasshopper Optimization Algorithm. Int. J. Electron. 6(12), 19–25 (2017)

    Google Scholar 

  4. Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66–73 (1992)

    Article  Google Scholar 

  5. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  6. Shi, Y.H., Eberhart, R.C.: A modified particle swarm optimizer. In: Proceedings of the IEEE Conference on Evolutionary Computation, Anchorage, pp. 69–73 (1998)

    Google Scholar 

  7. Li, H.L., Hou, C.Z., Zhou, S.S.: High efficient algorithm of modified particle swarm optimization. Comput. Eng. Appl. 44(1), 14–16 (2008)

    Google Scholar 

  8. Saremi, S., Mirjalili, S., Lewis, A.: Grasshopper optimization algorithm: theory and application. Adv. Eng. Softw. 105, 30–47 (2017)

    Article  Google Scholar 

  9. Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46–61 (2014)

    Article  Google Scholar 

  10. Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51–67 (2016)

    Article  Google Scholar 

  11. Potter, M.A., De Jong, K.A.: A cooperative coevolutionary approach to function optimization. In: Davidor, Y., Schwefel, H.-P., Männer, R. (eds.) PPSN 1994. LNCS, vol. 866, pp. 249–257. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-58484-6_269

    Chapter  Google Scholar 

  12. Pan, G., Li, K., Ouyang, A., et al.: Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP. Soft. Comput. 20(2), 555–566 (2016)

    Article  Google Scholar 

  13. Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82–102 (1999)

    Article  Google Scholar 

  14. Digalakis, J.G., Margaritis, K.G.: On benchmarking functions for genetic algorithms. Int. J. Comput. Math 77(4), 481–506 (2001)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kun Shao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huo, X., Zhang, F., Luo, C., Tan, J., Shao, K. (2019). A Cooperative Particle Swarm Optimization Algorithm Based on Greedy Disturbance. In: Lin, Z., et al. Pattern Recognition and Computer Vision. PRCV 2019. Lecture Notes in Computer Science(), vol 11859. Springer, Cham. https://doi.org/10.1007/978-3-030-31726-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-31726-3_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-31725-6

  • Online ISBN: 978-3-030-31726-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics