Skip to main content

Self-adaptive Quantum Particle Swarm Optimization for Dynamic Environments

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

Abstract

The quantum-inspired particle swarm optimization (QPSO) algorithm has been developed to find and track an optimum for dynamic optimization problems. Though QPSO has been shown to be effective, despite its simplicity, it does introduce an additional control parameter: the radius of the quantum cloud. The performance of QPSO is sensitive to the value assigned to this problem dependent parameter, which basically limits the area of the search space wherein new, better optima can be detected. This paper proposes a strategy to dynamically adapt the quantum radius, with changes in the environment. A comparison of the adaptive radius QPSO with the static radius QPSO showed that the adaptive approach achieves desirable results, without prior tuning of the quantum radius.

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. Angeline, P.J.: Tracking extrema in dynamic environments. In: Angeline, P.J., Reynolds, R.G., McDonnell, J.R., Eberhart, R. (eds.) EP 1997. LNCS, vol. 1213, pp. 335–345. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0014823

    Chapter  Google Scholar 

  2. Blackwell, T.: Particle swarm optimization in dynamic environments. In: Yang, S., Ong, Y.S., Jin, Y. (eds.) Evolutionary Computation in Dynamic and Uncertain Environments, vol. 51, pp. 29–49. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-49774-5_2

    Chapter  Google Scholar 

  3. Blackwell, T., Branke, J.: Multi-swarm optimization in dynamic environments. In: Raidl, G. (ed.) EvoWorkshops 2004. LNCS, vol. 3005, pp. 489–500. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24653-4_50

    Chapter  Google Scholar 

  4. Blackwell, T., Branke, J., Li, X.: Particle swarms for dynamic optimization problems. In: Blum, C., Merkle, D. (eds.) Swarm Intelligence, pp. 193–217. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-74089-6_6

    Chapter  Google Scholar 

  5. Branke, J.: Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol. 3, p. 1882 (1999). https://doi.org/10.1109/CEC.1999.785502

  6. Branke, J.: The moving peaks benchmark (1999). http://www.aifb.uni-karlsruhe.de/~jbr/MovPeaks/movpeaks

  7. Deb, K., Joshi, D., Anand, A.: Real-coded evolutionary algorithms with parent-centric recombination. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 1, pp. 61–66, May 2002. https://doi.org/10.1109/CEC.2002.1006210

  8. Duhain, J.G.: Particle swarm optimisation in dynamically changing environments-an empirical study. Master’s thesis, University of Pretoria (2011)

    Google Scholar 

  9. Duhain, J.G., Engelbrecht, A.P.: Towards a more complete classification system for dynamically changing environments. In: 2012 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2012)

    Google Scholar 

  10. Eberhart, R.C., Shi, Y.: Tracking and optimizing dynamic systems with particle swarms. In: Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546), vol. 1, pp. 94–100 (2001). https://doi.org/10.1109/CEC.2001.934376

  11. Engelbrecht, A.: Roaming behavior of unconstrained particles. In: Proceedings - 1st BRICS Countries Congress on Computational Intelligence, BRICS-CCI 2013, pp. 104–111 (09 2013)

    Google Scholar 

  12. Harrison, K., Ombuki-Berman, B.M., Engelbrecht, A.P.: The effect of probability distributions on the performance of quantum particle swarm optimization for solving dynamic optimization problems. In: 2015 IEEE Symposium Series on Computational Intelligence, pp. 242–250, Decembrer 2015. https://doi.org/10.1109/SSCI.2015.44

  13. Harrison, K.R., Ombuki-Berman, B.M., Engelbrecht, A.P.: A radius-free quantum particle swarm optimization technique for dynamic optimization problems. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 578–585, July 2016. https://doi.org/10.1109/CEC.2016.7743845

  14. Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  15. Hu, X., Eberhart, R.: Tracking dynamic systems with PSO: where’s the cheese. In: Proceedings of the workshop on particle swarm optimization, pp. 80–83 (2001)

    Google Scholar 

  16. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Joint Conference on Neural Networks, vol. IV, pp. 1942–1948. IEEE (1995)

    Google Scholar 

  17. Li, C., et al.: Benchmark generator for CEC 2009 competition on dynamic optimization. University of Leicester, UK, Technocal report (2008)

    Google Scholar 

  18. Morrison, R.W.: Performance measurement in dynamic environments. In: GECCO workshop on evolutionary algorithms for dynamic optimization problems, pp. 5–8. Citeseer (2003)

    Google Scholar 

  19. Moser, I., Chiong, R.: Dynamic function optimization: the moving peaks benchmark. In: Alba, E., Nakib, A., Siarry, P. (eds.) Metaheuristics for Dynamic Optimization, vol. 433, pp. 35–59. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-30665-5_3

    Chapter  Google Scholar 

  20. Pampará, G., Nepomuceno, F., Leonard, B.: Cilib v2.0.1, October 2014. https://doi.org/10.5281/zenodo.12371

  21. van der Stockt, S., Engelbrecht, A.P.: Analysis of hyper-heuristic performance in different dynamic environments. In: 2014 IEEE Symposium on Computational Intelligence in Dynamic and Uncertain Environments (CIDUE), pp. 1–8. IEEE (2014)

    Google Scholar 

  22. Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997). https://doi.org/10.1023/A:1008202821328

    Article  MathSciNet  MATH  Google Scholar 

  23. Trojanowski, K., Michalewicz, Z.: Searching for optima in non-stationary environments. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, vol. 3, pp. 1843–1850. IEEE (1999)

    Google Scholar 

  24. Van Den Bergh, F.: An analysis of particle swarm optimizers. Ph.D. thesis, Pretoria, South Africa, South Africa (2002). aAI0804353

    Google Scholar 

  25. Van Den Bergh, F., Engelbrecht, A.P.: A study of particle swarm optimization particle trajectories. Inf. Sci. 176(8), 937–971 (2006)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gary Pamparà .

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

Pamparà, G., Engelbrecht, A.P. (2018). Self-adaptive Quantum Particle Swarm Optimization for Dynamic Environments. 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_13

Download citation

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

  • 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