MLA: A New Mutated Leader Algorithm for Solving Optimization Problems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18470%2F22%3A50018605" target="_blank" >RIV/62690094:18470/22:50018605 - isvavai.cz</a>

Result on the web

<a href="https://www.techscience.com/cmc/v70n3/45000" target="_blank" >https://www.techscience.com/cmc/v70n3/45000</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.32604/cmc.2022.021072" target="_blank" >10.32604/cmc.2022.021072</a>

Result language

angličtina

Original language name

MLA: A New Mutated Leader Algorithm for Solving Optimization Problems

Original language description

Optimization plays an effective role in various disciplines of science and engineering. Optimization problems should either be optimized using the appropriate method (i.e., minimization or maximization). Optimization algorithms are one of the efficient and effective methods in providing quasioptimal solutions for these type of problems. In this study, a new algorithm called the Mutated Leader Algorithm (MLA) is presented. The main idea in the proposed MLA is to update the members of the algorithm population in the search space based on the guidance of a mutated leader. In addition to information about the best member of the population, the mutated leader also contains information about the worst member of the population, as well as other normal members of the population. The proposed MLA is mathematically modeled for implementation on optimization problems. A standard set consisting of twenty-three objective functions of different types of unimodal, fixed-dimensional multimodal, and high-dimensional multimodal is used to evaluate the ability of the proposed algorithm in optimization. Also, the results obtained from the MLA are compared with eight well-known algorithms. The results of optimization of objective functions show that the proposed MLA has a high ability to solve various optimization problems. Also, the analysis and comparison of the performance of the proposed MLA against the eight compared algorithms indicates the superiority of the proposed algorithm and ability to provide more suitable quasi-optimal solutions.

Czech name

—

Czech description

—

Type

J_imp - 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)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2022

Confidentiality

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

Name of the periodical

CMC-Computers, Materials &amp; Continua

ISSN

1546-2218

e-ISSN

1546-2226

Volume of the periodical

70

Issue of the periodical within the volume

3

Country of publishing house

US - UNITED STATES

Number of pages

19

Pages from-to

5631-5649

UT code for WoS article

000707334500042

EID of the result in the Scopus database

2-s2.0-85117045481