All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

New Running Technique for the Bison Algorithm

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F18%3A63520481" target="_blank" >RIV/70883521:28140/18:63520481 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-3-319-91253-0_39" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-91253-0_39</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-91253-0_39" target="_blank" >10.1007/978-3-319-91253-0_39</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    New Running Technique for the Bison Algorithm

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Volume 10841

  • ISBN

    978-331991252-3

  • ISSN

    03029743

  • e-ISSN

    neuvedeno

  • Number of pages

    10

  • Pages from-to

    417-426

  • Publisher name

    Springer Verlag

  • Place of publication

    Berlín

  • Event location

    Zakopane

  • Event date

    Jun 3, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article