Skip to main content

Constrained Function Optimization Using PSO with Polynomial Mutation

  • Conference paper

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

Abstract

Constrained function optimization using particle swarm optimization (PSO) with polynomial mutation is proposed in this work. In this method non-stationary penalty function approach is adopted and polynomial mutation is performed on global best solution in PSO. The proposed method is applied on 6 benchmark problems and obtained results are compared with the results obtained from basic PSO. The experimental results show the efficiency and effectiveness of the method.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Parsopoulos, K.E., Vrahatis, M.N.: Particle Swarm Optimization Method for Constrained Optimization Problems. In: ACM Symposium on Applied Computing - SAC (2002)

    Google Scholar 

  2. Higashi, N., lba, H.: Particle Swarm Optimization with Gaussian Mutation. In: IEEE Swarm Intelligence Symposium, Indianapolis, pp. 72–79 (2003)

    Google Scholar 

  3. Wang, H., Liu,Y., Li,C.H., Zeng, S.Y.: A hybrid particle swarm algorithm with Cauchy mutation. In: Proc. of IEEE Swarm Intelligence Symposium, pp. 356–360 (2007)

    Google Scholar 

  4. Stacey, A., Jancic, M., Grundy, I.: Particle swarm optimization with mutation. In: Proc. Congr. Evol. Comput., pp. 1425–1430 (2003)

    Google Scholar 

  5. Tang, J., Zhao, X.: Particle Swarm Optimization with Adaptive Mutation. In: WASE International Conference on Information Engineering (2009)

    Google Scholar 

  6. Wu, X., Zhong, M.: Particle Swarm Optimization Based on Power Mutation. In: ISECS International Colloquium on Computing, Communication, Control, and Management (2009)

    Google Scholar 

  7. Saha, A., Datta, R., Deb, K.: Hybrid Gradient Projection based Genetic Algorithms for Constrained Optimization. In: IEEE Congress on Evolutionary Computation - CEC, pp. 1–8 (2010)

    Google Scholar 

  8. Mallipeddi, R., Suganthan, P.: Problem Definitions and Evolution Criteria for the CEC 2010 Competition on Constrained Real-Parameter Optimization, Technical Report, Nayang Technological University, Singapore (2010)

    Google Scholar 

  9. Raghuswanshi, M.M., Kakde, O.G.: Survey on multiobjective evolutionary and real code genetic algorithms Complexity. International 11 (2005)

    Google Scholar 

  10. Gao, Y., Ren, Z.: Adaptive Particle Swarm Optimization Algorithm With Genetic Mutation Operation. In: Third International Conference on Natural Computation (ICNC 2007) (2007)

    Google Scholar 

  11. Li, C., Liu, Y., Zhou, A., Kang, L., Wang, H.: A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy. In: Kang, L., Liu, Y., Zeng, S. (eds.) ISICA 2007. LNCS, vol. 4683, pp. 334–343. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley and Sons (2001)

    Google Scholar 

  13. Esquivel, S.C., Coello, Coello, C.A.: On the use of particle swarm optimization with multimodal functions. In: Proc. Congr. Evol. Comput., pp. 1130–1136 (2003)

    Google Scholar 

  14. Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: Proc. IEEE World Congr. Comput. Intell., pp. 69–73 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Si, T., Jana, N.D., Sil, J. (2011). Constrained Function Optimization Using PSO with Polynomial Mutation. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27172-4_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27172-4_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27171-7

  • Online ISBN: 978-3-642-27172-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics