MOMRFO: Multi-objective Manta ray foraging optimizer for handling engineering design problems

An improved multi-objective particle swarm optimization algorithm for the design of foundation pit of rail transit upper cover project

In this study, a multi-objective particle swarm optimization (MOIPSO) algorithm is proposed to address complex optimization problems, including real-world engineering challenges. The algorithm retains the basic convergence mechanism of particle swarm optimization (PSO) as its core, while innovatively combining the fast non-dominated sorting technique to effectively evaluate and approximate the Pareto optimal solution set. To enhance the diversity and generalization of the solution set, the crowding distance mechanism is introduced, ensuring a good balance between multiple optimization objectives and a wider coverage of the solution space. Additionally, an acceleration factor based on trigonometric functions and an adaptive Gaussian mutation strategy are incorporated, improving the exploration ability of the particles in the search space and facilitating their movement towards the global optimal solution more effectively. The performance of the algorithm is verified using the multi-modal multi-objective benchmark function set provided by CEC2020, and comparisons are made with five advanced multi-objective metaheuristics. The MOIPSO algorithm is also applied to solve the design problem of rail transit upper cover foundation pit, further demonstrating the practical effectiveness of the proposed algorithm. The results show that MOIPSO not only performs well in multi-objective function testing but also proves highly competitive in solving real-world engineering problems. Note that the source codes of MOGWO are publicly available at https://au.mathworks.com/matlabcentral/fileexchange/177404-moipso-optimization-engineering-problem .

A decomposition-based multiobjective evolutionary algorithm using Simulated Annealing for the ambulance dispatching and relocation problem during COVID-19

The outbreak of the COVID-19 epidemic has had a significant impact in increasing the number of emergency calls, which causes significant problems to emergency medical services centers (EMS) in many countries around the world, such as Saudi Arabia, which attracts a huge number of pilgrims during pilgrimage seasons. Among these issues, we address real-time ambulance dispatching and relocation problems (real-time ADRP). This paper proposes an improved MOEA/D algorithm using Simulated Annealing (G-MOEA/D-SA) to handle the real-time ADRP issue. The simulated annealing (SA) seeks to obtain optimal routes for ambulances to cover all emergency COVID-19 calls through the implementation of convergence indicator based dominance relation (CDR). To prevent the loss of good solutions once they are found in the G-MOEA/D-SA algorithm, we employ an external archive population to store the non-dominated solutions using the epsilon dominance relationship. Several experiments are conducted on real data collected from Saudi Arabia during the Covid-19 pandemic to compare our algorithm with three relevant state-of-art algorithms including MOEA/D, MOEA/D-M2M and NSGA-II. Statistical analysis of the comparative results obtained using ANOVA and Wilcoxon test demonstrate the merits and the outperformance of our G-MOEA/D-SA algorithm.

An optimized features selection approach based on Manta Ray Foraging Optimization (MRFO) method for parasite malaria classification

Malaria is a serious and lethal disease that has been reported by the World Health Organization (WHO), with an estimated 219 million new cases and 435,000 deaths globally. The most frequent malaria detection method relies mainly on the specialists who examine the samples under a microscope. Therefore, a computerized malaria diagnosis system is required. In this article, malaria cell segmentation and classification methods are proposed. The malaria cells are segmented using a color-based k-mean clustering approach on the selected number of clusters. After segmentation, deep features are extracted using pre-trained models such as efficient-net-b0 and shuffle-net, and the best features are selected using the Manta-Ray Foraging Optimization (MRFO) method. Two experiments are performed for classification using 10-fold cross-validation, the first experiment is based on the best features selected from the pre-trained models individually, while the second experiment is performed based on the selection of best features from the fusion of extracted features using both pre-trained models. The proposed method provided an accuracy of 99.2% for classification using the linear kernel of the SVM classifier. An empirical study demonstrates that the fused features vector results are better as compared to the individual best-selected features vector and the existing latest methods published so far.

Non-Dominated Sorting Manta Ray Foraging Optimization for Multi-Objective Optimal Power Flow with Wind/Solar/Small- Hydro Energy Sources

This present study describes a novel manta ray foraging optimization approach based non-dominated sorting strategy, namely (NSMRFO), for solving the multi-objective optimization problems (MOPs). The proposed powerful optimizer can efficiently achieve good convergence and distribution in both the search and objective spaces. In the NSMRFO algorithm, the elitist non-dominated sorting mechanism is followed. Afterwards, a crowding distance with a non-dominated ranking method is integrated for the purpose of archiving the Pareto front and improving the optimal solutions coverage. To judge the NSMRFO performances, a bunch of test functions are carried out including classical unconstrained and constrained functions, a recent benchmark suite known as the completions on evolutionary computation 2020 (CEC2020) that contains twenty-four multimodal optimization problems (MMOPs), some engineering design problems, and also the modified real-world issue known as IEEE 30-bus optimal power flow involving the wind/solar/small-hydro power generations. Comparison findings with multimodal multi-objective evolutionary algorithms (MMMOEAs) and other existing multi-objective approaches with respect to performance indicators reveal the NSMRFO ability to balance between the coverage and convergence towards the true Pareto front (PF) and Pareto optimal sets (PSs). Thus, the competing algorithms fail in providing better solutions while the proposed NSMRFO optimizer is able to attain almost all the Pareto optimal solutions.