Skip to main content

Boundary Constraint Handling Techniques for Particle Swarm Optimization in High Dimensional Problem Spaces

  • Conference paper
  • First Online:
Swarm Intelligence (ANTS 2018)

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

Included in the following conference series:

Abstract

This paper investigates the use of boundary constraint handling mechanisms to prevent unwanted particle roaming behaviour in high dimensional spaces. The paper tests a range of strategies on a benchmark for large scale optimization. The empirical analysis shows that the hyperbolic strategy, which scales down a particle’s velocity as it approaches the boundary, performs statistically significantly better than the other methods considered in terms of the best objective function value achieved. The hyperbolic strategy directly addresses the velocity explosion, thereby preventing unwanted roaming.

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

Similar content being viewed by others

References

  1. Alvarez-Benitez, J.E., Everson, R.M., Fieldsend, J.E.: A MOPSO algorithm based exclusively on pareto dominance concepts. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 459–473. Springer, Heidelberg (2005). https://doi.org/10.1007/978-3-540-31880-4_32

    Chapter  Google Scholar 

  2. Bonyadi, M.R., Michalewicz, Z.: Impacts of coefficients on movement patterns in the particle swarm optimization algorithm. IEEE Trans. Evol. Comput. 21(3), 378–390 (2017). https://doi.org/10.1109/TEVC.2016.2605668

    Article  Google Scholar 

  3. Bratton, D., Kennedy, J.: Defining a standard for particle swarm optimization. In: Proceedings of the IEEE Swarm Intelligence Symposium, pp. 120–127. IEEE Computer Society (2007). https://doi.org/10.1109/SIS.2007.368035

  4. Chu, W., Gao, X., Sorooshian, S.: Handling boundary constraints for particle swarm optimization in high-dimensional search space. Inf. Sci. 181(20), 4569–4581 (2011). https://doi.org/10.1016/j.ins.2010.11.030

    Article  Google Scholar 

  5. Cleghorn, C.W., Engelbrecht, A.P.: Particle swarm stability: a theoretical extension using the non-stagnate distribution assumption. Swarm Intell. 12, 1–22 (2017). https://doi.org/10.1007/s11721-017-0141-x

    Article  Google Scholar 

  6. Clerc, M.: Confinements and biases in particle swarm optimization, March 2006. http://clerc.maurice.free.fr/pso/. Accessed 12 Mar 2006

  7. Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58–73 (2002). https://doi.org/10.1109/4235.985692

    Article  Google Scholar 

  8. Deb, K.: Optimization for Engineering Design: Algorithms and Examples. Prentice-Hall, Upper Saddle River (1995)

    Google Scholar 

  9. Eberhart, R., 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 (Oct 1995). https://doi.org/10.1109/MHS.1995.494215

  10. Helwig, S., Branke, J., Mostaghim, S.: Experimental analysis of bound handling techniques in particle swarm optimization. IEEE Trans. Evol. Comput. 17(2), 259–271 (2013). https://doi.org/10.1109/TEVC.2012.2189404

    Article  Google Scholar 

  11. Helwig, S., Wanka, R.: Particle swarm optimization in high-dimensional bounded search spaces. In: Proceedings of the IEEE Swarm Intelligence Symposium, pp. 198–205. IEEE Computer Society, April 2007. https://doi.org/10.1109/SIS.2007.368046

  12. Helwig, S., Wanka, R.: Theoretical analysis of initial particle swarm behavior. In: Rudolph, G., Jansen, T., Beume, N., Lucas, S., Poloni, C. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 889–898. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87700-4_88

    Chapter  Google Scholar 

  13. Huang, T., Mohan, A.S.: A hybrid boundary condition for robust particle swarm optimization. IEEE Antennas Wirel. Propag. Lett. 4, 112–117 (2005). https://doi.org/10.1109/LAWP.2005.846166

    Article  Google Scholar 

  14. Mostaghim, S., Mostaghim, S., Halter, W., Wille, A.: Linear multi-objective particle swarm optimization. In: Ajith, A., Crina, G., Vitorino, R. (eds.) Stigmergic Optimization, vol. 31, pp. 209–238. Springer, Heidelberg (2006). https://doi.org/10.1007/978-3-540-34690-6_9

    Chapter  Google Scholar 

  15. Oldewage, E.: The perils of particle swarm optimisation in high dimensional problem spaces. Master’s thesis, University of Pretoria, Pretoria, South Africa (2018)

    Google Scholar 

  16. Padhye, N., Deb, K., Mittal, P.: Boundary handling approaches in particle swarm optimization. In: Bansal, J.C., Singh, P.K., Deep, K., Pant, M., Nagar, A.K. (eds.) Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications, vol. 1, pp. 287–298. Springer, India (2013). https://doi.org/10.1007/978-81-322-1038-2_25

    Chapter  Google Scholar 

  17. Reklaitis, G., Ravindran, A., Ragsdell, K.: Engineering Optimization Methods and Applications. Wiley, Hoboken (1983)

    Google Scholar 

  18. Robinson, J., Rahmat-Samii, Y.: Particle swarm optimization in electromagnetics. IEEE Trans. Antennas Propag. 52(2), 397–407 (2004). https://doi.org/10.1109/TAP.2004.823969

    Article  MathSciNet  MATH  Google Scholar 

  19. Shi, Y., Cheng, S., Qin, Q.: Experimental study on boundary constraints handling in particle swarm optimization: From population diversity perspective. Int. J. Swarm Intell. Res. 2(3), 43–69 (2011). https://doi.org/10.4018/jsir.2011070104

    Article  Google Scholar 

  20. Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 69–73, May 1998. https://doi.org/10.1109/ICEC.1998.699146

  21. Tang, K., Li, X., Suganthan, P.N., Yang, Z., Weise, T.: Benchmark functions for the CEC’2010 special session and competition on large-scale global optimization. Technical report, Nature Inspired Computation and Applications Laboratory (2009)

    Google Scholar 

  22. Zhang, W., Xie, X., Bi, D.: Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space. CoRR abs/cs/0505069 (2005). http://arxiv.org/abs/cs/0505069

Download references

Acknowledgments

This work is based on the research supported by the National Research Foundation (NRF) of South Africa (Grant Number 46712). The opinions, findings and conclusions or recommendations expressed in this article is that of the author(s) alone, and not that of the NRF. The NRF accepts no liability whatsoever in this regard.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Elre T. Oldewage .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Oldewage, E.T., Engelbrecht, A.P., Cleghorn, C.W. (2018). Boundary Constraint Handling Techniques for Particle Swarm Optimization in High Dimensional Problem Spaces. In: Dorigo, M., Birattari, M., Blum, C., Christensen, A., Reina, A., Trianni, V. (eds) Swarm Intelligence. ANTS 2018. Lecture Notes in Computer Science(), vol 11172. Springer, Cham. https://doi.org/10.1007/978-3-030-00533-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00533-7_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00532-0

  • Online ISBN: 978-3-030-00533-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics