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”

Gannet optimization algorithm : A new metaheuristic algorithm for solving engineering optimization problems

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F22%3A10251901" target="_blank" >RIV/61989100:27240/22:10251901 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.sciencedirect.com/science/article/pii/S0378475422002774?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0378475422002774?via%3Dihub</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.matcom.2022.06.007" target="_blank" >10.1016/j.matcom.2022.06.007</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Gannet optimization algorithm : A new metaheuristic algorithm for solving engineering optimization problems

  • Original language description

    Engineering design problems are usually large-scale constrained optimization problems, and metaheuristic algorithms are vital for solving such complex problems. Therefore, this paper introduces a new nature-inspired metaheuristic algorithm: the gannet optimization algorithm (GOA). The GOA mathematizes the various unique behaviors of gannets during foraging and is used to enable exploration and exploitation. GOA&apos;s U-shaped and V-shaped diving patterns are responsible for exploring the optimal region within the search space, with sudden turns and random walks ensuring better solutions are found in this region. In order to verify the ability of the GOA to find the optimal solution, we compared it with other comparison algorithms in multiple dimensions of 28 benchmark functions. We found that the GOA has a shorter running time in high dimensions and can provide a better solution. Finally, we apply the GOA to five engineering optimization problems. The experimental results show that the GOA is suitable for many constrained engineering design problems and can provide better solutions in most cases.(c) 2022 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.

  • 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

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • 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

    Mathematics and computers in simulation

  • ISSN

    0378-4754

  • e-ISSN

    1872-7166

  • Volume of the periodical

    202

  • Issue of the periodical within the volume

    prosinec 2022

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    31

  • Pages from-to

    343-373

  • UT code for WoS article

    000822807100002

  • EID of the result in the Scopus database