Skip to main content

Multi-Objective Particle Swarm Optimization Algorithm Based on Comprehensive Optimization Strategies

  • Conference paper
  • First Online:
Advances in Swarm and Computational Intelligence (ICSI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9140))

Included in the following conference series:

  • 1774 Accesses

Abstract

Multi-objective particle swarm optimization algorithm based on comprehensive optimization strategies (MOPSO-COS) is proposed in this paper to deal with the problems of premature convergence and poor diversity. The velocity updating mode is modified by incorporating the information of the global second best particle to promote information flowing among particles. In order to improve the convergence accuracy and diversity, some effective strategies, such as chaotic mutation, external archiving with dynamic grid method, selection strategy based on a temporary population and so on, are introduced into MOPSO-COS. Theoretical analysis of MOPSO-COS is carried out including convergence and time complexity. Performance tests are conducted with ZDT test functions. Simulation results show that MOPSO-COS can improve the convergence accuracy and diversity of Pareto optimal solutions simultaneously, and particles can escape from local optimum point effectively.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liu, B., Zhang, W., Li, G., Nie, R.: Improved Multi-Objective Particle Swarm Optimization Algorithm. Journal of Beijing University of Aeronautics and Astronautics 39(4), 458–462 (2013). (in Chinese)

    Google Scholar 

  2. Chen, M., Wu, C., and Fleming, P.J.: An Evolutionary particle swarm algorithm for multi-objective optimization. In: The 7th World Congress on Intelligent Control and Automation, pp. 3269–3274. IEEE Press, Chongqing (2008)

    Google Scholar 

  3. Ratnaweera, A., Halgamuge, S., Watson, H.C.: Self-Organizing Hierarchical Particle Swarm Optimizer with Time-Varying Acceleration Coefficients. IEEE Transactions on Evolutionary Computation 8(3), 240–255 (2004)

    Article  Google Scholar 

  4. Pang, S., Zou, H., Yang, W., et al.: An Adaptive Mutated Multi-objective Particle Swarm Optimization with an Entropy-based Density Assessment Scheme. Information & Computational Science 4, 1065–1074 (2013)

    Google Scholar 

  5. Sun, C., Zeng, J., Chu, S., et al.: Solving constrained optimization problems by an improved particle swarm optimization. In: 2011 Second International Conference on Innovations in Bio-inspired Computing and Applications (IBICA), pp. 124–128. IEEE Press, Shen Zhen (2011)

    Google Scholar 

  6. Hu, C., Yao, H., Yan, X.: Multiple Particle Swarms Co-evolutionary Algorithm for Dynamic Multi-objective Optimization Problems and Its Application. Journal of computer research and development 50(6), 1313–1323 (2013). (in Chinese)

    Google Scholar 

  7. Zhou, X., Chen, C., Yang, F., Chen, M.: Optimal Coordinated HVDC Modulation Based on Adaptive Chaos Particle Swarm Optimization Algorithm in Multi-Infeed HVDC Transmission System. Transactions of China Electrotechnical Society 24(50), 193–201 (2009). (in Chinese)

    Google Scholar 

  8. Zheng, X., Liu, H.: Progress of Research on Multi Objective Evolutionary Algorithms. Computer Science 34(7), 187–191 (2007). (in Chinese)

    Google Scholar 

  9. Wu, X., Xu, Q.: Optimization Model of Multi-Objective Distribution Based on Adaptive Grid Particle Swarm Optimization Algorithm. Journal of Highway and Transportation Research and Development 27(5), 132–136 (2010). (in Chinese)

    Google Scholar 

  10. Luo, H., Chen, M., Cheng, T.: Adaptive Time-Intervalled Reactive Power Optimization for Distribution Network Containing Wind Power Generation. Power System Technology 38(8), 2207–2212 (2014). (in Chinese)

    Google Scholar 

  11. Chen, M., Cheng, S.: Multi-Objective Particle Swarm Optimization Algorithm Based on Random Black Hole Mechanism and Step-by-Step Elimination Strategy. Control and Decision 28(11), 1729–1734 (2013). (in Chinese)

    Google Scholar 

  12. Li, Y.: Model-Based Multi-objective Constellation Optimization Algorithm Design. China University of Geosciences, May 2010. (in Chinese)

    Google Scholar 

  13. Chen, M., Zhang, C., Luo, C.: Adaptive Evolution Multi-Objective Particle Swarm Optimization Algorithm. Control and Decision 24(12), 1851–1855 (2009). (in Chinese)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huan Luo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Luo, H., Chen, M., Ke, T. (2015). Multi-Objective Particle Swarm Optimization Algorithm Based on Comprehensive Optimization Strategies. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds) Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science(), vol 9140. Springer, Cham. https://doi.org/10.1007/978-3-319-20466-6_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20466-6_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20465-9

  • Online ISBN: 978-3-319-20466-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics