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”

DMT-OMPA: Innovative applications of an efficient adversarial Marine Predators Algorithm based on dynamic matrix transformation in engineering design optimization

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F24%3A10256970" target="_blank" >RIV/61989100:27240/24:10256970 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    DMT-OMPA: Innovative applications of an efficient adversarial Marine Predators Algorithm based on dynamic matrix transformation in engineering design optimization

  • Original language description

    This paper introduces an innovative variant of the Marine Predators Algorithm (MPA), termed the Dynamic Matrix Transformation-based Oppositional Marine Predators Algorithm (DMT-OMPA), aimed at enhancing the efficiency of engineering optimization strategies. Traditional MPAs have several shortcomings, including insufficient solution diversity and coverage in the initialization phase, a tendency to become trapped in local optima, and inadequate search capabilities in the later stages of iteration, all of which negatively impact the algorithm&apos;s efficiency and effectiveness. To address these issues, the DMT-OMPA incorporates oppositional learning mechanisms and dynamic matrix transformation strategies, significantly enhancing global search capabilities and accelerating convergence speed, particularly in handling complex multidimensional optimization problems.Experimental results on the CEC2013 and CEC2017 test suites demonstrate that DMT-OMPA outperforms other recent MPA variants, various classical algorithm variants, and newly proposed algorithms, verifying its advantages in precision and reliability. Furthermore, the application of this algorithm to various real-world engineering problems substantiates its broad applicability and high efficiency. The study&apos;s findings not only deepen our understanding of swarm intelligence optimization algorithms but also provide a new efficient tool for solving complex engineering problems. The results indicate a promising potential for wider application in diverse fields, suggesting that the DMT-OMPA algorithm could become an effective tool for tackling complex optimization problems in the future. © 2024

  • 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

    2024

  • 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

    Computer Methods in Applied Mechanics and Engineering

  • ISSN

    0045-7825

  • e-ISSN

  • Volume of the periodical

    431

  • Issue of the periodical within the volume

    Nov

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    65

  • Pages from-to

  • UT code for WoS article

    001283975500001

  • EID of the result in the Scopus database

    2-s2.0-85199762430