Skip to main content

Chaotic bean optimization algorithm

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Inspired by the dispersal mode of beans and the evolution of population distribution in nature, a novel bionic intelligent optimization algorithm-named bean optimization algorithm (BOA) is proposed. It has stable robust behavior on explored tests and stands out as a promising alternative to existing optimization methods. In this paper, an improved bean optimization algorithm, named chaotic bean optimization algorithm (CBOA), is introduced. The CBOA algorithm makes full use both of the fast convergence of the BOA algorithm and the ergodicity, stochastic, sensitivity properties of chaotic motions. The chaos sequence in CBOA is generated by using logic mapping function. The core contents of the algorithm include the several aspects: (1) Both of the diversity of individuals and the ergodicity of seeding locations in the initial are improved population by applying chaotic serialization for the initial bean group; (2) the distribution of offspring beans is optimized and the global optimization ability and stability of BOA are improved by producing tiny chaotic disturbance to offspring beans according to their father beans. In order to verify the validity of the CBOA, function optimization experiments are carried out, which include six typical benchmark functions and the CEC2014 benchmark functions. A comparative analysis is performed based on the experiments of particle swarm optimization and BOA. We also research on the characters of CBOA. A contrast analysis is carried out to verify the research conclusions about the relations between the algorithm parameters and its performance.

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
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Explore related subjects

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

References

  • Ba-yi C, Hua-Ping C, Hao S, Rui X, Huang GQ (2008) A chaotic ant colony optimization method for scheduling a single batch-processing machine with non-identical job sizes. In: IEEE Congress on evolutionary computation, CEC 2008, pp 40–43

  • Bing L, Weisun J (1997) Chaos optimization algorithm and its application. Control Theory Appl 4:613–615

    Google Scholar 

  • Bungartz H-J et al (2014) Chaos theory. Modeling and simulation. Springer, Berlin, pp 291–314

    Google Scholar 

  • Caponetto R, Fortuna L, Fazzino S, Xibilia MG (2003) Chaotic sequences to improve the performance of evolutionary algorithms. IEEE Trans Evol Comput 7:289–304

    Article  Google Scholar 

  • Deep K, Chauhan P, Pant M (2012) Totally disturbed chaotic particle swarm optimization. In: IEEE Congress on evolutionary computation (CEC), pp 1–8

  • Determan J, Foster JA (1999) Using chaos in genetic algorithm. In: Proceedings of the 1999 Congress on evolutionary computation. Piscataway, NJ: IEEE Press, 1 vol 3, pp 2094–2101

  • Elbeltagia E, Hegazyb T, Grierson D (2005) Comparison among five evolutionarybased optimization algorithms. Adv Eng Inform 19(1):43C53

    Google Scholar 

  • Fangjun K, Zhong J, Weihong X, Siyang Z (2014) A novel chaotic artificial bee colony algorithm based on tent map. In: IEEE Congress on evolutionary computation (CEC), pp 235–241

  • Ferens K, Cook D, Kinsner W (2013) Chaotic simulated annealing for task allocation in a multiprocessing system. In: 12th IEEE International Conference on cognitive informatics & cognitive computing (ICCI*CC), pp 26–35

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings., IEEE International Conference on neural networks, vol 4, pp 1942–1948

  • Kromer P, Snael V, Zelinka I (2013) Randomness and chaos in genetic algorithms and differential evolution. In: 5th International Conference on intelligent networking and collaborative systems (INCoS), pp 196–201

  • Liang H (2011) Analysis and applications of chaos particle swarm optimization. Guangdong University of Technology, Guangdong, Guangzhou

    Google Scholar 

  • Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Computational intelligence laboratory. Zhengzhou University, Zhengzhou China and Technical report, Nanyang Technology University, Singapore

  • Metlicka M, Davendra D (2014) Chaos-driven discrete artificial bee colony. In: IEEE Congress on evolutionary computation(CEC), pp 2947–2954

  • Pluhacek M, Senkerik R, Davendra D (2015) Multiple choice strategy with dimensional mutation for PSO algorithm enhanced with chaotic dissipative standard map In: IEEE Congress on evolutionary computation(CEC), pp 1404–1409

  • Pluhacek M, Senkerik R, Zelinka I, Davendra D (2013) Chaos PSO algorithm driven alternately by two different chaotic maps - an initial study. In: IEEE Congress on evolutionary computation (CEC), pp 2444–2449

  • Shen M, Chen WN, Zhang J, Chung HSH, Kaynak O (2013) Optimal selection of parameters for nonuniform embedding of chaotic time series using ant colony optimization. IEEE Trans Cybern 43(2):790–802

    Article  Google Scholar 

  • Xiaoming Zhang, Rujing Wang, Liangtu Song (2008) A novel evolutionary algorithm - seed optimization algorithm. Pattern Recognit Artif Intell 21(5):677–681

    Google Scholar 

  • Xiaoming Z, Hailei W, Bingyu S, Wenbo L, Rujing W (2013) The markov model of bean optimization algorithm and its convergence analysis. Int J Comput Intell Syst 6:609–615

    Article  Google Scholar 

  • Xiaoming Z, Bingyu S, Tao M et al (2013) A novel evolutionary algorithm inspired by beans dispersal. Int J Comput Intell Syst 6(1):79–86

    Article  Google Scholar 

  • Yuyao H (2002) Chaotic simulated annealing with decaying chaotic noise. IEEE Trans Neural Netw 13:1526–1531

    Article  Google Scholar 

  • Zhang X (2011) Research on a novel swarm intelligent algorithm inspired by beans dispersal. University of Science and Technology of China, Hefei

    Google Scholar 

  • Zhang X, Jiang K, Wang H et al (2012) An improvedbean optimization algorithm for solving TSP. Advances in swarmintelligence, ICSI 2012. Pt I 7331, Shenzhen pp 261–267

  • Zhang X, Sun B, Mei T, Wang R (2010) Post-disaster restoration based on fuzzy preference relation and bean optimization algorithm. IEEE YC-ICT’2010, pp 253–256. doi:10.1109/YCICT.2010.5713097

Download references

Author's contribution

Dr. Xiaoming Zhang is the designer of bean optimization algorithm (BOA) and the chaotic bean optimization algorithm (CBOA). He wrote the most MATLAB code of BOA in the experiment parts of this paper and also fully guide Tinghao Feng to write this paper, experiment and revise this paper. Tinghao Feng is the co-first author.

Acknowledgements

This study was funded by National Science Foundation of China (Grant Number 61203373).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaoming Zhang.

Ethics declarations

Conflict of interest:

Author Tinghao Feng declares that he has no conflict of interest. Author Xiaoming Zhang declares that he has no conflict of interest.

Ethical approval:

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, X., Feng, T. Chaotic bean optimization algorithm. Soft Comput 22, 67–77 (2018). https://doi.org/10.1007/s00500-016-2322-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-016-2322-8

Keywords