Hybridization of Manta-Ray Foraging Optimization Algorithm with Pseudo Parameter-Based Genetic Algorithm for Dealing Optimization Problems and Unit Commitment Problem

Abstract

The manta ray foraging optimization algorithm (MRFO) is one of the promised meta-heuristic optimization algorithms. However, it can stick to a local minimum, consuming iterations without reaching the optimum solution. So, this paper proposes a hybridization between MRFO, and the genetic algorithm (GA) based on a pseudo parameter; where the GA can help MRFO to escape from falling into the local minimum. It is called a pseudo genetic algorithm with manta-ray foraging optimization (PGA-MRFO). The proposed algorithm is not a classical hybridization between MRFO and GA, wherein the classical hybridization consumes time in the search process as each algorithm is applied to all system variables. In addition, the classical hybridization results in an extended search algorithm, especially in systems with many variables. The PGA-MRFO hybridizes the pseudo-parameter-based GA and the MRFO algorithm to produce a more efficient algorithm that combines the advantages of both algorithms without getting stuck in a local minimum or taking a long time in the calculations. The pseudo parameter enables the GA to be applied to a specific number of variables and not to all system variables leading to reduce the computation time and burden. Also, the proposed algorithm used an approximation for the gradient of the objective function, which leads to dispensing derivatives calculations. Besides, PGA-MRFO depends on the pseudo inverse of non-square matrices, which saves calculations time; where the dependence on the pseudo inverse gives the algorithm more flexibility to deal with square and non-square systems. The proposed algorithm will be tested on the test functions that the main MRFO failed to find their optimum solution to prove its capability and efficiency. In addition, it will be applied to solve the unit commitment (UC) problem as one of the vital power system problems to show the validity of the proposed algorithm in practical applications. Finally, several analyses will be applied to the proposed algorithm to illustrate its effectiveness and reliability.

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

“…Manta Ray Foraging Optimization (MRFO) method is used for best feature selection. MRFO consists of three main steps such as chain fore-aging, cyclone fore-aging, and somersault fore-aging ( 42 – 44 ).…”

Manta Ray Foraging Optimization Algorithm: Modifications and Applications

“…Mohammed et al [123] proposed a hybridization of MRFO and the GA based on a pseudo-parameter, where the GA can help MRFO escape the local minimum. This hybridized algorithm is a pseudo-GA with MRFO, which hybridizes the pseudo-parameter-based GA and MRFO algorithm to produce a more efficient algorithm that combines the advantages of both algorithms without becoming trapped in a local minimum or taking a long time to calculate.…”

A New Treatment Solution of Interval Nonlinear Programming Problems: A Case Study of Green Fuel Production

“…Different natural swarm systems based EAs have been effectively used in practical applications. There are numerous EAs, including the genetic algorithm (GA) [22], the particle swarm optimization (PSO) [23], the fruit fly algorithm (FFA) [24], the manta-ray foraging optimization algorithm (MRFOA) [25], the grasshopper optimization algorithm (GOA) [26], the sine cosine algorithm (SCA) [27] the firefly algorithm (FA) [28], etc. The KKT optimality conditions for interval-valued objective functions and real-valued constraint functions were discussed in [29][30][31][32].…”