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 nondominance 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. INDEX TERMS Arithmetic Optimization Algorithm (AOA); CEC-2021 real-world problems; Constrained optimization; Multi-Objective Arithmetic Optimization Algorithm (MOAOA). I. INTRODUCTIONRecently, computer technology advancements have increased the quality of addressing complex problems and decreased the time and cost of producing the optimal solution. However, human input is yet needed to determine the best of different solutions. Significant efforts can be seen in the literature to produce a system that optimally solves the given problem without any human effort [1]. One of the most reliable methods to accomplish this depends on optimization techniques. In many instances, most engineering problems, such as city programming, program management, investment decision, control system design, engineering

This paper proposes a new Multi-Objective Equilibrium Optimizer (MOEO) to handle complex optimization problems, including real-world engineering design optimization problems. The Equilibrium Optimizer (EO) is a recently reported physics-based metaheuristic algorithm, and it has been inspired by the models used to predict equilibrium state and dynamic state. A similar procedure is utilized in MOEO by combining models in a different target search space. The crowding distance mechanism is employed in the MOEO algorithm to balance exploitation and exploration phases as the search progresses. In addition, a non-dominated sorting strategy is also merged with the MOEO algorithm to preserve the population diversity and it has been considered as a crucial problem in multi-objective metaheuristic algorithms. An archive with an update function is used to uphold and improve the coverage of Pareto with optimal solutions. The performance of MOEO is validated for 33 contextual problems with 6 constrained, 12 unconstrained, and 15 practical constrained engineering design problems, including non-linear problems. The result obtained by the proposed MOEO algorithm is compared with other state-of-the-art multi-objective optimization algorithms. The quantitative and qualitative results indicate that the proposed MOEO provides more competitive outcomes than the different algorithms. From the results obtained for all 33 benchmark optimization problems, the efficiency, robustness, and exploration ability to solve multi-objective problems of the MOEO algorithm are well defined and clarified. The paper is further supported with extra online service and guideline at https://premkumarmanoharan.wixsite.com/mysite.

No abstract

In machine learning and data mining, feature selection (FS) is a traditional and complicated optimization problem. Since the run time increases exponentially, FS is treated as an NP-hard problem. The researcher's effort to build a new FS solution was inspired by the ongoing need for an efficient FS framework and the success rates of swarming outcomes in different optimization scenarios. This paper presents two binary variants of a Hunger Games Search Optimization (HGSO) algorithm based on V-and S-shaped transfer functions within a wrapper FS model for choosing the best features from a large dataset. The proposed technique transforms the continuous HGSO into a binary variant using V-and S-shaped transfer functions (BHGSO-V and BHGSO-S). To validate the accuracy, 16 famous UCI datasets are considered and compared with different state-of-the-art metaheuristic binary algorithms. The findings demonstrate that BHGSO-V achieves better performance in terms of the selected number of features, classification accuracy, run time, and fitness values than other state-of-the-art algorithms. The results demonstrate that the BHGSO-V algorithm can reduce dimensionality and choose the most helpful features for classification problems. The proposed BHGSO-V achieves 95% average classification accuracy for most of the datasets, and run time is less than 5 sec. for low and medium dimensional datasets and less than 10 sec for high dimensional datasets.

No abstract