Your search

This chapter presents Hybrid Whale Optimization Algorithm (HWOA) to tackle the stubborn problems of local optima traps and initialization sensitivity of the K-means clustering technique. This work was inspired by the popularity and robustness of meta-heuristic algorithms in providing compelling solutions, which sparked several effective approaches and computational tools to address challenging real-world problems. The Chameleon Swarm Algorithm (CSA) is embedded with the bubble-net mechanism of WOA to help the search agents of HWOA effectively explore and exploit each potential area of the search space, enhancing the capability of both exploitation and exploration aspects of the classic WOA. Additionally, the search agents of HWOA use a rotation mechanism to relocate to new spots outside of nearby areas to conduct global exploration. This process increases the search efficiency of WOA while also enhancing the diversity and intensity behavior of the search agents. These improvements to HWOA increase its capacity for exploitation and broaden the range of search scopes and directions in performing clustering tasks. To assess the effectiveness of the proposed HWOA on clustering activities, a total of ten distinct datasets from the UCI are used, each with a different level of complexity. According to the experimental findings, the proposed HWOA outperforms eight meta-heuristic algorithms-based clustering and the conventional K-means clustering technique by a statistically significant margin in terms of performance distance metric.

Over recent decades, research in Artificial Intelligence (AI) has developed a broad range of approaches and methods that can be utilized or adapted to address complex optimization problems. As real-world problems get increasingly complicated, this requires an effective optimization method. Various meta-heuristic algorithms have been developed and applied in the optimization domain. This paper used and ameliorated a promising meta-heuristic approach named Crow Search Algorithm (CSA) to address numerical optimization problems. Although CSA can efficiently optimize many problems, it needs more searchability and early convergence. Its positioning updating process was improved by supporting two adaptive parameters: flight length (fl) and awareness probability (AP) to tackle these curbs. This is to manage the exploration and exploitation conducts of CSA in the search space. This process takes advantage of the randomization of crows in CSA and the adoption of well-known growth functions. These functions were recognized as exponential, power, and S-shaped functions to develop three different improved versions of CSA, referred to as Exponential CSA (ECSA), Power CSA (PCSA), and S-shaped CSA (SCSA). In each of these variants, two different functions were used to amend the values of fl and AP. A new dominant parameter was added to the positioning updating process of these algorithms to enhance exploration and exploitation behaviors further. The reliability of the proposed algorithms was evaluated on 67 benchmark functions, and their performance was quantified using relevant assessment criteria. The functionality of these algorithms was illustrated by tackling four engineering design problems. A comparative study was made to explore the efficacy of the proposed algorithms over the standard one and other methods. Overall results showed that ECSA, PCSA, and SCSA have convincing merits with superior performance compared to the others.

This work proposes a new evolutionary multilayer perceptron neural networks using the recently proposed Bird Swarm Algorithm. The problem of finding the optimal connection weights and neuron biases is first formulated as a minimization problem with mean square error as the objective function. The BSA is then used to estimate the global optimum for this problem. A comprehensive comparative study is conducted using 13 classification datasets, three function approximation datasets, and one real-world case study (Tennessee Eastman chemical reactor problem) to benchmark the performance of the proposed evolutionary neural network. The results are compared with well-regarded conventional and evolutionary trainers and show that the proposed method provides very competitive results. The paper also considers a deep analysis of the results, revealing the flexibility, robustness, and reliability of the proposed trainer when applied to different datasets.

This work proposes a new approach in addressing Economic Load Dispatch (ELD) optimization problem in power unit systems using nature-inspired metaheuristics search algorithms. Solving such a problem requires a degree of maximization of the economic pact of a power network system, where this is possible with some existing population-based metaheuristic search algorithms. The key issue to be handled here is how to maximize the economic benevolence of a power network under a variety of operational constraints, taking into account the reduction in the generated fuel cost as well as the aggregate power loss in the transmission power network system. Some nature-inspired metaheuristics will be explored. Meanwhile, we shall focus our attention on a newly developed nature-inspired search algorithm, referred to as the Crow Search Algorithm or CSA for short, as well as the Differential Evolution (DE) that is commonly known as a metaheuristic. The CSA emerged to light by simulating the intelligent flocking behavior of crows. The practicability of the proposed approach-based CSA was conducted to common types of power generators, including three and six buses (nodes) in addition to the IEEE 30-bus standard system. The results of the presented approaches were compared to other results developed using existing nature-inspired metaheuristic algorithms like particle swarm optimization and genetic algorithms and also compared to traditional approaches such as quadratic programming method. The results reported here support that CSA has achieved an outstanding performance in solving the problem of ELD in power systems, demonstrating their good optimization capabilities through arriving at a combination of power loads that consummate the constraints of the ELD problem while simultaneously lessening the entire fuel cost. The experimental results also showed that the CSA solutions were capable of maximizing the reliability of the power supplied to the customers, and also reducing both the generated power cost and the loss of power in the transmission power systems.

The students’ performance prediction (SPP) problem is a challenging problem that managers face at any institution. Collecting educational quantitative and qualitative data from many resources such as exam centers, virtual courses, e-learning educational systems, and other resources is not a simple task. Even after collecting data, we might face imbalanced data, missing data, biased data, and different data types such as strings, numbers, and letters. One of the most common challenges in this area is the large number of attributes (features). Determining the highly valuable features is needed to improve the overall students’ performance. This paper proposes an evolutionary-based SPP model utilizing an enhanced form of the Whale Optimization Algorithm (EWOA) as a wrapper feature selection to keep the most informative features and enhance the prediction quality. The proposed EWOA combines the Whale Optimization Algorithm (WOA) with Sine Cosine Algorithm (SCA) and Logistic Chaotic Map (LCM) to improve the overall performance of WOA. The SCA will empower the exploitation process inside WOA and minimize the probability of being stuck in local optima. The main idea is to enhance the worst half of the population in WOA using SCA. Besides, LCM strategy is employed to control the population diversity and improve the exploration process. As such, we handled the imbalanced data using the Adaptive Synthetic (ADASYN) sampling technique and converting WOA to binary variant employing transfer functions (TFs) that belong to different families (S-shaped and V-shaped). Two real educational datasets are used, and five different classifiers are employed: the Decision Trees (DT), k-Nearest Neighbors (k-NN), Naive Bayes (NB), Linear Discriminant Analysis (LDA), and LogitBoost (LB). The obtained results show that the LDA classifier is the most reliable classifier with both datasets. In addition, the proposed EWOA outperforms other methods in the literature as wrapper feature selection with selected transfer functions.