Border Collie Optimization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F20%3A10246265" target="_blank" >RIV/61989100:27240/20:10246265 - isvavai.cz</a>
Result on the web
<a href="https://ieeexplore.ieee.org/document/9106341" target="_blank" >https://ieeexplore.ieee.org/document/9106341</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/ACCESS.2020.2999540" target="_blank" >10.1109/ACCESS.2020.2999540</a>
Alternative languages
Result language
angličtina
Original language name
Border Collie Optimization
Original language description
In recent times, several metaheuristic algorithms have been proposed for solving real world optimization problems. In this paper, a new metaheuristic algorithm, called the Border Collie Optimization is introduced. The algorithm is developed by mimicking the sheep herding styles of Border Collie dogs. The Border Collie's unique herding style from the front as well as from the sides is adopted successfully in this paper. In this algorithm, the entire population is divided into two parts viz., dogs and sheep. This is done to equally focus on both exploration and exploitation of the search space. The Border Collie utilizes a predatory move called eyeing. This technique of the dogs is utilized to prevent the algorithm from getting stuck into local optima. A sensitivity analysis of the proposed algorithm has been carried out using the Sobol's sensitivity indices with the Sobol g-function for tuning of parameters. The proposed algorithm is applied on thirty-five benchmark functions. The proposed algorithm provides very competitive results, when compared with seven state-of-the-art algorithms like Ant Colony optimization, Differential algorithm, Genetic algorithm, Grey-wolf optimizer, Harris Hawk optimization, Particle Swarm optimization and Whale optimization algorithm. The performance of the proposed algorithm is analytically and visually tested by different methods to judge its supremacy. Finally, the statistical significance of the proposed algorithm is established by comparing it with other algorithms by employing Kruskal-Wallis test and Friedman test.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
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
<a href="/en/project/EF17_049%2F0008425" target="_blank" >EF17_049/0008425: A Research Platform focused on Industry 4.0 and Robotics in Ostrava Agglomeration</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2020
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
Name of the periodical
IEEE Access
ISSN
2169-3536
e-ISSN
—
Volume of the periodical
8
Issue of the periodical within the volume
červen
Country of publishing house
US - UNITED STATES
Number of pages
21
Pages from-to
109177-109197
UT code for WoS article
000549854400029
EID of the result in the Scopus database
2-s2.0-85087330032