Skip to main content

Arithmetic and parent-centric headless chicken crossover operators for dynamic particle swarm optimization algorithms

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper conducts an analysis of various strategies for incorporating the headless chicken macromutation operator into a dynamic particle swarm optimization algorithm. Seven variations of the dynamic headless chicken guaranteed convergence particle swarm optimization algorithm are proposed and evaluated on a diverse set of single-objective dynamic benchmark problems. Competitive performance was demonstrated by the headless chicken PSO algorithms when compared to, amongst others, a quantum particle swarm optimization algorithm.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Angeline P (1997) Subtree crossover: building block engine or macromutation. Genet Program 97:9–17

    Google Scholar 

  • Benson K (2000) Evolving finite state machines with embedded genetic programming for automatic target detection. In: Congress on evolutionary computation, pp 1543–1549

  • Blackwell TM, Bentley PJ (2002) Dynamic search with charged swarms. In: Proceedings of the 4th annual conference on genetic and evolutionary computation, Morgan Kaufmann Publishers Inc, pp 19–26

  • Blackwell T, Branke J (2004) Multi-swarm optimization in dynamic environments. In: Raidl GR et al (eds) Applications of evolutionary computing. EvoWorkshops 2004. Lecture Notes in Computer Science, vol 3005. Springer, Berlin, Heidelberg

  • Blackwell T, Branke J (2006) Multiswarms, exclusion, and anti-convergence in dynamic environments. IEEE Trans Evol Comput 10(4):459–472

    Article  Google Scholar 

  • Branke J (1999) Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of the 1999 congress on evolutionary computation, CEC 99, IEEE, vol 3, pp 1875–1882

  • Branke J (2001) Evolutionary approaches to dynamic environments—updated survey. In: Proceedings of GECCO Workshop in evolutionary algorithms for dynamic optimization problems, pp 27–30

  • Citi L, Poli R, Cinel C, Sepulveda F (2008) P300-based bci mouse with genetically-optimized analogue control. IEEE Trans Neural Syst Rehabil Eng 16(1):51–61

    Article  Google Scholar 

  • Deb K, Joshi D, Anand A (2002) Real-coded evolutionary algorithms with parent-centric recombination. In: Proceedings of the 2002 congress on evolutionary computation, CEC’02, IEEE, vol 1, pp 61–66

  • Duhain JG, Engelbrecht AP (2012) Towards a more complete classification system for dynamically changing environments. In: 2012 IEEE congress on evolutionary computation (CEC), IEEE, pp 1–8

  • Eberhart R, Kennedy J (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp 1942–1948

  • Eberhart RC, Shi Y (2001) Tracking and optimizing dynamic systems with particle swarms. In: Proceedings of the 2001 congress on evolutionary computation, IEEE, vol 1, pp 94–100

  • Engelbrecht AP (2006) Fundamentals of computational swarm intelligence. Wiley, New York

    Google Scholar 

  • Grobler J, Engelbrecht AP (2016) Headless chicken particle swarm optimization algorithms. Lecture notes in computer science: advances in swarm intelligence (ICSI 2016), vol 9712, pp 350–357

  • Helbig M, Engelbrecht A (2016) Using headless chicken crossover for local guide selection when solving dynamic multi-objective optimization. In: Advances in nature and biologically inspired computing, Springer, Berlin, pp 381–392

  • Hu X, Eberhart R (2001) Tracking dynamic systems with pso: whereas the cheese. In: Proceedings of the workshop on particle swarm optimization, pp 80–83

  • Hu X, Eberhart R.C (2002) Adaptive particle swarm optimization: detection and response to dynamic systems. In: Proceedings of the 2002 congress on evolutionary computation, CEC’02, IEEE, vol 2, pp 1666–1670

  • Hynek J (2004) Evolving strategy for game playing. In: 4th international ICSC symposium on engineering intelligent systems, pp 1–6

  • Jones T (1995) Crossover, macromutation, and population-based search. In: International conference on genetic algorithms, pp 73–80

  • Kennedy J, Mendes R (2002) Population structure and particle swarm performance. Proc IEEE Congr Evolut Comput 2:1671–1676

    Google Scholar 

  • Li C, Mavrovouniotis M, Yang S, Yao X (2013) Benchmark generator for the IEEE WCCI-2014 competition on evolutionary computation for dynamic optimization problems: dynamic rotation peak benchmark generator (DRPBG) and dynamic composition benchmark generator (DCBG). De Montfort University, UK, technical report

  • Li X, Branke J, Blackwell T (2006) Particle swarm with speciation and adaptation in a dynamic environment. In: Proceedings of the 8th annual conference on Genetic and evolutionary computation, ACM, pp 51–58

  • Liu L, Yang S, Wang D (2010) Particle swarm optimization with composite particles in dynamic environments. IEEE Trans Syst Man Cybern Part B (Cybern) 40(6):1634–1648

    Article  Google Scholar 

  • Lung RI, Dumitrescu D (2007) A collaborative model for tracking optima in dynamic environments. In: IEEE congress on evolutionary computation, CEC 2007, IEEE, pp 564–567

  • Michalewicz Z (1996) Genetic algorithms + data structures = evolutionary programs. Springer, Berlin

    Book  MATH  Google Scholar 

  • Poli R, McPhee N (2000) Exact GP schema theory for headless chicken crossover with subtree mutation. Cognitive science research papers—University of Birmingham CSRP

  • Psaraftis HN (1995) Dynamic vehicle routing: status and prospects. Ann Oper Res 61(1):143–164

    Article  MATH  Google Scholar 

  • Van den Bergh F, Engelbrecht A (2002) A new locally convergent particle swarm optimiser. Proc Man Cybern Int Conf Syst 3:6–12

    Google Scholar 

Download references

Acknowledgements

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 are that of the authors 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 Jacomine Grobler.

Ethics declarations

Conflict of interest

No other potential conflicts of interest exist, and the article does not contain any studies with human or animal participants. Sub Elements in Acknowledgement

Additional information

Communicated by S. Deb, T. Hanne, K.C. Wong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Grobler, J., Engelbrecht, A.P. Arithmetic and parent-centric headless chicken crossover operators for dynamic particle swarm optimization algorithms. Soft Comput 22, 5965–5976 (2018). https://doi.org/10.1007/s00500-017-2917-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-017-2917-8

Keywords