Skip to main content

An Improving Multi-Objective Particle Swarm Optimization

  • Conference paper
Web Information Systems and Mining (WISM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6318))

Included in the following conference series:

Abstract

In the past few years, a number of researchers have successfully extended particle swarm optimization to multiple objectives. However, it still is an important issue to obtain a well-converged and well-distributed set of Pareto-optimal solutions. In this paper, we propose a fuzzy particle swarm optimization algorithm based on fuzzy clustering method and fuzzy strategy and archive update. The particles are evaluated and the dominated solutions are stored into different cluster in the generation, while dominated solutions are pruned. The non-dominated solutions are selected by fuzzy strategy, and the non-dominated solutions are added to the archive. It is observed that the proposed fuzzy particle swarm optimization algorithm is a competitive method in the terms of convergence near to the Pareto-optimal front, diversity of solutions.

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. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the Fourth IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)

    Google Scholar 

  2. Fieldsend, J.E.: Multi-objective particle swarm optimization methods (2004)

    Google Scholar 

  3. Coello, C.A.C., Lechunga, M.S.: MOPSO: A Proposal for Multiple Objective Particle Swarm Optimizations. In: Proceedings of the 2002 Congress on Evolutionary Computation, part of 2002 IEEE World Congress on Computational Intelligence, Hawaii, May 12-17, pp. 1051–1056 (2002)

    Google Scholar 

  4. Fieldsend, J.E., Singth, S.: A Multi-Objective Algorithm based upon Particle Swarm Optimisation, an Efficient Data Structure and Turbulence. In: Proceedings of UK Workshop on Computational Intelligence, Birmingham,UK, September 2-4, pp. 37–44 (2002)

    Google Scholar 

  5. Hu, X., Eberthart, R.: Multiobjective Optimization Using Dynamic Neiborhood Particle Swarm Optimization. In: Proceedings of the 2002 Congress on Evolutionary Computation, part of the 2002 IEEE world Congress on Computational Intelligence, Hawii, May 12-17 (2002)

    Google Scholar 

  6. Parsopoulos, K.E., Vrahatis, M.N.: Particle Swarm Optimization Method in Multiobjective Problems. In: Proceedings of the 2002 ACM Symposium on Applied Computing, pp. 605–607 (2002)

    Google Scholar 

  7. Branke, J., Kamper, A., Schmeck, H.: Distribution of evolutionary algorithms in heterogeneous networks. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 923–934. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Mostaghim, S., Teich, J.: Covering pareto-optimal fronts by subswarms in multi-objective particle swarm optimization. In: IEEE Proceedings, World Congress on Computational Intelligence(CEC 2004), Portland, USA, pp. 1404–1411 (June 2004)

    Google Scholar 

  9. Mehnen, J., Michelitsch, T., Schmitt, K., Kohlen, T.: pMOHypEA: Parallel evolutionary multiobjective optimization using hypergraphs. Interner Bericht des Sonderforschungsbereichs 531 Computational Intelligence CI–189/04, Universität Dortmund (Dezember 2004)

    Google Scholar 

  10. Zitzler, E., Deb, K., Thiele, L.: Comparison of multi- objective evolutionary algorithms: Empirical results, Evolutionary Computation, pp. 173–195 (2000)

    Google Scholar 

  11. Abbass, H.A., Sarker, R., Newton, C.: PDE: A pareto-frontier differential evolution approach for multi-objective optimization problems. In: Proceedings of the Congress on Evolutionary Computation 2001 (CEC 2001), vol. 2, pp. 971–978. IEEE Service Center, New Jersey (2001)

    Google Scholar 

  12. Madavan, N.K.: Multiobjective optimization using a pareto differential evolution approach. In: Congress on Evolutionary Computation (CEC 2002), vol. 2, pp. 1145–1150. IEEE Service Center, New Jersey (2002)

    Google Scholar 

  13. Zitzler, E., Deb, K., Thiele, L.: Comparison of multi- objective evolutionary algorithms: Empirical results, Evolutionary Computation, pp. 173–195 (2000)

    Google Scholar 

  14. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and Elitist Multi-objective Genetic Algorithm: NSGA_II. IEEE Transaction on Evolutionary Computation 6(2), 182–197 (2002)

    Article  Google Scholar 

  15. Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro-machine and Human Science, pp. 39–43 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fan, J. (2010). An Improving Multi-Objective Particle Swarm Optimization. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds) Web Information Systems and Mining. WISM 2010. Lecture Notes in Computer Science, vol 6318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16515-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16515-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16514-6

  • Online ISBN: 978-3-642-16515-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics