An Archive-Based Multi-Objective Arithmetic Optimization Algorithm for Solving Industrial Engineering Problems

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/9911646" target="_blank" >https://ieeexplore.ieee.org/document/9911646</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ACCESS.2022.3212081" target="_blank" >10.1109/ACCESS.2022.3212081</a>

Jazyk výsledku

angličtina

Název v původním jazyce

An Archive-Based Multi-Objective Arithmetic Optimization Algorithm for Solving Industrial Engineering Problems

Popis výsledku v původním jazyce

This research proposes an Archive-based Multi-Objective Arithmetic Optimization Algorithm (MAOA) as an alternative to the recently established Arithmetic Optimization Algorithm (AOA) for multi-objective problems (MAOA). The original AOA approach was based on the distribution behavior of vital mathematical arithmetic operators, such as multiplication, division, subtraction, and addition. The idea of the archive is introduced in MAOA, and it may be used to find non-dominated Pareto optimum solutions. The proposed method is tested on seven benchmark functions, ten CEC-2020 mathematic functions, and eight restricted engineering design challenges to determine its suitability for solving real-world engineering difficulties. The experimental findings are compared to five multi-objective optimization methods (Multi-Objective Particle Swarm Optimization (MOPSO), Multi-Objective Slap Swarm Algorithm (MSSA), Multi-Objective Ant Lion Optimizer (MOALO), Multi-Objective Genetic Algorithm (NSGA2) and Multi-Objective Grey Wolf Optimizer (MOGWO) reported in the literature using multiple performance measures. The empirical results show that the proposed MAOA outperforms existing state-of-the-art multi-objective approaches and has a high convergence rate.

Název v anglickém jazyce

An Archive-Based Multi-Objective Arithmetic Optimization Algorithm for Solving Industrial Engineering Problems

Popis výsledku anglicky

This research proposes an Archive-based Multi-Objective Arithmetic Optimization Algorithm (MAOA) as an alternative to the recently established Arithmetic Optimization Algorithm (AOA) for multi-objective problems (MAOA). The original AOA approach was based on the distribution behavior of vital mathematical arithmetic operators, such as multiplication, division, subtraction, and addition. The idea of the archive is introduced in MAOA, and it may be used to find non-dominated Pareto optimum solutions. The proposed method is tested on seven benchmark functions, ten CEC-2020 mathematic functions, and eight restricted engineering design challenges to determine its suitability for solving real-world engineering difficulties. The experimental findings are compared to five multi-objective optimization methods (Multi-Objective Particle Swarm Optimization (MOPSO), Multi-Objective Slap Swarm Algorithm (MSSA), Multi-Objective Ant Lion Optimizer (MOALO), Multi-Objective Genetic Algorithm (NSGA2) and Multi-Objective Grey Wolf Optimizer (MOGWO) reported in the literature using multiple performance measures. The empirical results show that the proposed MAOA outperforms existing state-of-the-art multi-objective approaches and has a high convergence rate.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2022

Kód důvěrnosti údajů

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

Název periodika

IEEE Access

ISSN

2169-3536

e-ISSN

2169-3536

Svazek periodika

10

Číslo periodika v rámci svazku

05 October 2022

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

26

Strana od-do

106673-106698

Kód UT WoS článku

000866442500001

EID výsledku v databázi Scopus

—