Skip to main content

Bean Optimization Algorithm Based on Negative Binomial Distribution

  • Conference paper
  • First Online:
Advances in Swarm and Computational Intelligence (ICSI 2015)

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

Included in the following conference series:

Abstract

Many complex self-adaptive phenomena in the nature often give us inspirations. Some scholars are inspired from these natural bio-based phenomena and proposed many nature-inspired optimization algorithms. When solving some complex problems which cannot be solved by the traditional optimization algorithms easily, the nature-inspired optimization algorithms have their unique advantages. Inspired by the transmission mode of seeds, a novel evolutionary algorithm named Bean Optimization Algorithm (BOA) is proposed, which can be used to solve complex optimization problems by simulating the adaptive phenomenon of plants in the nature. BOA is the combination of nature evolutionary tactic and limited random search. It has stable robust behavior on explored tests and stands out as a promising alternative to existing optimization methods for engineering designs or applications. Through research and study on the relevant research results of biostatistics, a novel distribution model of population evolution for BOA is built. This model is based on the negative binomial distribution. Then a kind of novel BOA algorithm is presented based on the distribution models. In order to verify the validity of the Bean Optimization Algorithm based on negative binomial distribution model (NBOA), function optimization experiments are carried out, which include four typical benchmark functions. The results of the experiments are made a comparative analysis with that of particle swarm optimization (PSO) and BOA. From the results analysis, we can see that the performance of NBOA is better than that of PSO and BOA. We also conduct a research on the characters of NBOA. 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 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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Holland, J.H.: Adaption in Natural and Artificial Systems. The MIT Press, Cambridge (1992)

    Google Scholar 

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

    Google Scholar 

  3. Xiaolei, L., Zhijiang, S., Jixin, Q.: An Optimizing Method Based on Autonomous Animats: Fish-swarm Algorithm. Systems Engineering Theory & Practice 22(11), 32–38 (2002)

    Google Scholar 

  4. Kalin, P., Guy, L.: Free Search-a comparative analysis. Information Sciences 172(1–2), 173–193 (2005)

    MathSciNet  Google Scholar 

  5. Montiela, O., Castillob, O., Melinb, P., Díazc, A.R., Sepúlvedaa, R.: Human evolutionary model: A new approach to optimization. Information Sciences 177(10), 2075–2098 (2007)

    Article  Google Scholar 

  6. He, S., Wu, Q.H., Saunders, J.R.: Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior. IEEE Transactions on Evolutionary Computation 13(5), 973–990 (2009)

    Article  Google Scholar 

  7. Ho, S.-Y., Lin, H.-S., Liauh, W.-H., Ho, S.-J.: OPSO: Orthogonal Particle Swarm Optimization and Its Application to Task Assignment Problems. IEEE Transactions on Systems, Man and Cybernetics, Part A 38(2), 288–298 (2008)

    Google Scholar 

  8. Souda, T., Silva, A., Neves, A.: Particle Swarm based Data Mining Algorithms for classification task. Parallel Computing 30(5), 767–783 (2004)

    Google Scholar 

  9. Li, S., Xixian, W., Tan, M.: Gene selection using hybrid particle swarm optimization and genetic algorithm. Soft Computing 12(11), 1039–1048 (2008)

    Article  Google Scholar 

  10. Zhang, X., Wang, R., Song, L.: A Novel Evolutionary Algorithm—Seed Optimization Algorithm. Pattern Recognition And Artificial Intelligence 21(5), 677–681 (2008)

    MathSciNet  Google Scholar 

  11. Li, Y.: Solving TSP by an ACO-and-BOA-based hybrid algorithm. In: Proceedings of 2010 International Conference on Computer Application and System Modeling, pp. 189–192 (2010)

    Google Scholar 

  12. Zhang, X., Jiang, K., Wang, H., Li, W., Sun, B.: An improved bean optimization algorithm for solving TSP. In: Tan, Y., Shi, Y., Ji, Z. (eds.) ICSI 2012, Part I. LNCS, vol. 7331, pp. 261–267. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Wang, P., Cheng, Y.: Relief Supplies Scheduling Based on Bean Optimization Algorithm. Economic Research Guide 8, 252–253 (2010)

    Google Scholar 

  14. Zhang, X., Sun, B., Mei, T., Wang, R.: Post-disaster restoration based on fuzzy preference relation and bean optimization algorithm. In: IEEE YC-ICT 2010, pp. 253–256 (2010)

    Google Scholar 

  15. Zhang, X., Sun, B., Mei, T., Wang, R.: A Novel Evolutionary Algorithm Inspired by Beans Dispersal. International Journal of Computational Intelligence Systems 6(1), 79–86 (2013)

    Article  Google Scholar 

  16. Dorigo, M., Birattari, M., Stützle, T.: Ant Colony Optimization– Artificial Ants as a Computational Intelligence Technique. IEEE Computational Intelligence Magazine 11(4), 28–39 (2006)

    Article  Google Scholar 

  17. Pham, D.T., Ghanbarzadeh A., Koc, E., Otri, S., Rahim, S., Zaidi, M.: The bees algorithm – a novel tool for complex optimisation problems. In: IPROMS 2006, pp. 454–461 (2006)

    Google Scholar 

  18. Zhang, X., Wang, H., Sun, B., Li, W., Wang, R.: The Markov Model of Bean Optimization Algorithm and Its Convergence Analysis. International Journal of Computational Intelligence Systems 6(4), 609–615 (2013)

    Article  Google Scholar 

  19. Zhang, X., Sun, B., Mei, T., Wang, R.: A Novel Evolutionary Algorithm Inspired by Beans Dispersal. International Journal of Computational Intelligence Systems 6(1), 79–86 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaoming Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Feng, T., Xie, Q., Hu, H., Song, L., Cui, C., Zhang, X. (2015). Bean Optimization Algorithm Based on Negative Binomial Distribution. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds) Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science(), vol 9140. Springer, Cham. https://doi.org/10.1007/978-3-319-20466-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20466-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20465-9

  • Online ISBN: 978-3-319-20466-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics