A New Arithmetic Optimization Algorithm for Solving Real-World Multiobjective CEC-2021 Constrained Optimization Problems: Diversity Analysis and Validations

In this paper, a new Multi-Objective Arithmetic Optimization Algorithm (MOAOA) is proposed for solving Real-World constrained Multi-objective Optimization Problems (RWMOPs). Such problems can be found in different areas, including mechanical engineering, chemical engineering, process and synthesis, and power electronics systems. MOAOA is inspired by the distribution behavior of the main arithmetic operators in mathematics. The proposed multi-objective version is formulated and developed from the recently introduced single-objective Arithmetic Optimization Algorithm (AOA) through an elitist non-dominance sorting and crowding distance-based mechanism. For the performance evaluation of MOAOA, a set of 35 constrained RWMOPs and five ZDT unconstrained problems are considered. For the fitness and efficiency evaluation of the proposed MOAOA, the results obtained from the MOAOA are compared with four other state-of-the-art multi-objective algorithms. In addition, five performance indicators, such as Hyper-Volume (HV), Spread (SP), Inverse Generalized Distance (IGD), Runtime (RT), and Generalized Distance (GD), are calculated for the rigorous evaluation of the performance and feasibility study of the MOAOA. The findings demonstrate the superiority of the MOAOA over other algorithms with high accuracy and coverage across all objectives. This paper also considers the Wilcoxon signed-rank test (WSRT) for the statistical investigation of the experimental study. The coverage, diversity, computational cost, and convergence behavior achieved by MOAOA show its high efficiency in solving ZDT and RWMOPs problems.