Skip to main content

New Running Technique for the Bison Algorithm

  • Conference paper
  • First Online:
Artificial Intelligence and Soft Computing (ICAISC 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10841))

Included in the following conference series:

  • 2178 Accesses

Abstract

This paper examines the performance of the Bison Algorithm with a new running technique. The Bison Algorithm was inspired by the typical behavior of bison herds: the swarming movement of endangered bison as the exploitation factor and the running as the exploration phase of the optimization.

While the original running procedure allowed the running group to scatter throughout the search space, the new approach proposed in this paper preserves the initial formation of the running group throughout the optimization process.

At the beginning of the paper, we introduce the Bison Algorithm and explain the new running technique procedure. Later the performance of the adjusted algorithm is tested and compared to the Particle Swarm Optimization and the Cuckoo Search algorithm on the IEEE CEC 2017 benchmark set, consisting of 30 functions. Finally, we evaluate the meaning of the experiment outcomes for future research.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Ouaarab, A., Ahiod, B., Yang, X.S.: Discrete Cuckoo Search algorithm for the travelling salesman problem. Neural Comput. Appl. 24(7–8), 1659–1669 (2014)

    Article  Google Scholar 

  2. Duan, Y., Ying, S.: A particle swarm optimization algorithm with ant search for solving traveling salesman problem. In: International Conference on Computational Intelligence and Security, Beijing, pp. 137–141 (2009)

    Google Scholar 

  3. Kennedy, J., Eberhart, R.: Particle swarm optimization. Proc. IEEE Int. Conf. Neural Netw. 4, 1942–1948 (1995)

    Article  Google Scholar 

  4. Yang, X.-S.: Firefly algorithm, Lévy flights and global optimization. In: Bramer, M., Ellis, R., Petridis, M. (eds.) Research and Development in Intelligent Systems XXVI, pp. 209–218. Springer, London (2010). https://doi.org/10.1007/978-1-84882-983-1_15

    Chapter  Google Scholar 

  5. Yang, X.-S., Deb, S.: Cuckoo Search via Lévy flights. In: Proceedings of World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), pp. 210–214, India, December 2009. IEEE Publications (2009)

    Google Scholar 

  6. Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46–61 (2014)

    Article  Google Scholar 

  7. Kazikova, A., Pluhacek, M., Senkerik R., Viktorin, A.: Proposal of a new swarm optimization method inspired in Bison behavior. In: Matousek, R. (ed.) Recent Advances in Soft Computing (Mendel 2017). Advances in Intelligent Systems and Computing. Springer, Heidelberg (2017, in press)

    Google Scholar 

  8. Faris, H., Aljarah, I., Mirjalili, S., Castillo, P., Merelo, J.: EvoloPy: an open-source nature-inspired optimization framework in Python. In: Proceedings of the 8th International Joint Conference on Computational Intelligence (IJCCI 2016), ECTA, vol. 1, pp. 171–177 (2016)

    Google Scholar 

  9. Awad, N.H., Ali, M.Z., Liang, J.J., Qu, B.Y., Suganthan, P.N.: Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective bound constrained real-parameter numerical optimization. Technical report, Nanyang Technological University, Singapore (2016)

    Google Scholar 

  10. Berman, R.: American Bison (Nature Watch). Lerner Publications, Minneapolis (2008)

    Google Scholar 

Download references

Acknowledgment

This work was supported by the Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme Project no. LO1303 (MSMT-7778/2014), further by the European Regional Development Fund under the Project CEBIA-Tech no. CZ.1.05/2.1.00/03.0089 and by Internal Grant Agency of Tomas Bata University under the Projects no. IGA/CebiaTech/2018/003. This work is also based upon support by COST (European Cooperation in Science and Technology) under Action CA15140, Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice (ImAppNIO), and Action IC1406, High-Performance Modelling and Simulation for Big Data Applications (cHiPSet). The work was further supported by resources of A.I.Lab at the Faculty of Applied Informatics, Tomas Bata University in Zlin (ailab.fai.utb.cz).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anezka Kazikova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kazikova, A., Pluhacek, M., Viktorin, A., Senkerik, R. (2018). New Running Technique for the Bison Algorithm. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2018. Lecture Notes in Computer Science(), vol 10841. Springer, Cham. https://doi.org/10.1007/978-3-319-91253-0_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91253-0_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91252-3

  • Online ISBN: 978-3-319-91253-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics