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

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 mathem...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE access 2022, Vol.10, p.106673-106698
Hauptverfasser: Khodadadi, Nima, Abualigah, Laith, El-Kenawy, El-Sayed M., Snasel, Vaclav, Mirjalili, Seyedali
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2022.3212081