Semnan University International Journal of Nonlinear Analysis and Applications 2008-6822 14 7 2023 07 01 Memetic algorithm for solving multi-objective assignment problem 73 80 6973 10.22075/ijnaa.2022.6973 EN Tuqaa Ali Radhi Department of Mathematics, University of Baghdad, Baghdad 00964, Iraq Iraq T. Abass Department of Mathematics, University of Baghdad, Baghdad 00964, Iraq Journal Article 2022 03 01 Despite the fact that statistical solutions for dealing with Multi-Objective Assignment Problems (MOAP) have just been available for a long time, the further application of Evolutionary Algorithms (EAs) to such difficulties presents a vehicle for tackling MOAP with an extraordinarily large scope. MOGASA is a suggested multi-objective optimizer with simulated annealing that combines the hegemony notion with a discrete wavelet transform. While decomposition streamlines the multi-objective problem (MOP) by expressing it as a collection of many corresponding authors, tackling these issues at the same time in the GA context may result in early agreement due to the command meanwhile screening process, which employs the Methodology as a criterion. Supremacy is important in constructing the leaders archive because it allows the chosen leaders to encompass fewer dense regions, eliminating local minima and meanwhile producing a more diverse approximating Allocative efficiency front. MOGASA outperforms several decomposition-based growth strategies, according to results from 31 stand meanwhile are MOPs. MATLAB was used to generate all of the findings (R2017b). https://ijnaa.semnan.ac.ir/article_6973_50b00e8b2c5b2f1296db399485ba8f7e.pdf