Explore the vast range of titles available.

Metaheuristic algorithms are novel optimization algorithms often inspired by nature. In recent years, scholars have proposed various metaheuristic algorithms, such as the genetic algorithm (GA), artificial bee colony, particle swarm optimization (PSO), crow search algorithm, and whale optimization algorithm (WOA), to solve optimization problems. Among these, PSO is the most commonly used. However, different algorithms have different limitations. For example, PSO is prone to premature convergence and falls into a local optimum, whereas GA coding is difficult and uncertain. Therefore, an algorithm that can increase the computing power and particle diversity can address the limitations of existing algorithms. Therefore, this paper proposes a hybrid algorithm, called whale particle optimization (WPO), that combines the advantages of the WOA and PSO to increase particle diversity and can jump out of the local optimum. The performance of the WPO algorithm was evaluated using four optimization problems: function evaluation, image clustering, permutation flow shop scheduling, and data clustering. The test data were selected from real-life situations. The results demonstrate that the proposed algorithm competes well against existing algorithms.

This paper focuses on the dynamic workforce scheduling and routing problem for the maintenance work of harvesters in a sugarcane harvesting operation. Technician teams categorized as mechanical, hydraulic, and electrical teams are assumed to have different skills at different levels to perform services. The jobs are skill-constrained and have time windows. During a working day, a repair request from a sugarcane harvester may arrive, and as time passes, the harvester’s position may shift to other sugarcane fields. We formulated this problem as a multi-visit and multi-period dynamic workforce scheduling and routing problem (MMDWSRP) and our study is the first to address the workforce scheduling and routing problem (WSRP). A mixed-integer programming formulation and a hybrid particle swarm and whale optimization algorithm (HPSWOA) were firstly developed to solve the problem, with the objective of minimizing the total cost, including technician labor cost, penalty for late service, overtime, travel, and subcontracting costs. The HPSWOA was developed for route planning and maintenance work for each mechanical harvester to be provided by technician teams. The proposed algorithm (HPSWOA) was validated against Lingo computational software using numerical experiments in respect of static problems. It was also tested against the current practice, the traditional whale optimization algorithm (WOA), and traditional particle swarm optimization (PSO) in respect of dynamic problems. The computational results show that the HPSWOA yielded a solution with significantly better quality. The HPSWO was also tested against the traditional genetic algorithm (GA), bat algorithm (BA), WOA, and PSO to solve the well-known CEC 2017 benchmark functions. The computational results show that the HPSWOA achieved more superior performance in most cases compared to the GA, BA, WOA, and PSO algorithms.

For machine learning algorithms, fine-tuning hyperparameters is a computational challenge due to the large size of the problem space. An efficient strategy for adjusting hyperparameters can be established with the use of the greedy search and Swarm intelligence algorithms. The Random Search and Grid Search optimization techniques show promise and efficiency for this task. The small population of solutions used at the outset, and the costly goal functions used by these searches, can lead to slow convergence or execution time in some cases. In this research, we propose using the machine learning model known as Support Vector Machine and optimizing it using four distinct algorithms—the Ant Bee Colony Algorithm, the Genetic Algorithm, the Whale Optimization, and the Particle Swarm Optimization—to evaluate the computational cost of SVM after hyper-tuning. Computational complexity comparisons of these optimization algorithms were performed to determine the most effective strategies for hyperparameter tuning. It was found that the Genetic Algorithm had a lower temporal complexity than other algorithms.

This paper introduces a new hybrid optimization algorithm (HWOANM) based on the Nelder–Mead local search algorithm (NM) and whale optimization algorithm (WOA). The aim of hybridization is to accelerate global convergence speed of the whale algorithm for solving manufacturing optimization problems. The main objective of our study on hybridization is to accelerate the global convergence rate of the whale algorithm to solve production optimization problems. This paper is the first research study of both the whale algorithm and HWOANM for the optimization of processing parameters in manufacturing processes. The HWOANM is evaluated using the well-known benchmark problems such as cantilever beam problem, welded beam problem, and three-bar truss problem. Finally, a grinding manufacturing optimization problem is solved to investigate the performance of the HWOANM. The results of the HWOANM for both the design and manufacturing problems solved in this paper are compared with other optimization algorithms presented in the literature such as the ant colony algorithm, genetic algorithm, scatter search algorithm, differential evolution algorithm, particle swarm optimization algorithm, simulated annealing algorithm, artificial bee colony algorithm, improved differential evolution algorithm, harmony search algorithm, hybrid particle swarm algorithm, teaching-learning–based optimization algorithm, cuckoo search algorithm, grasshopper optimization algorithm, salp swarm optimization algorithm, mine blast algorithm, gravitational search algorithm, ant lion optimizer, multi-verse optimizer, whale optimization algorithm, and the Harris hawks optimization algorithm. The results show that the HWOANM provides better exploration and exploitation properties, and can be considered as a promising new algorithm for optimizing both design and manufacturing optimization problems.

Nature is a great source of inspiration for solving complex problems in real-world. In this paper, a hybrid nature-inspired algorithm is proposed for feature selection problem. Traditionally, the real-world datasets contain all kinds of features informative as well as non-informative. These features not only increase computational complexity of the underlying algorithm but also deteriorate its performance. Hence, there an urgent need of feature selection method that select an informative subset of features from high dimensional without compromising the performance of the underlying algorithm. In this paper, we select an informative subset of features and perform cluster analysis by employing a cross breed approach of binary particle swarm optimization (BPSO) and sine cosine algorithm (SCA) named as hybrid binary particle swarm optimization and sine cosine algorithm (HBPSOSCA). Here, we employ a V-shaped transfer function to compute the likelihood of changing position for all particles. First, the effectiveness of the proposed method is tested on ten benchmark test functions. Second, the HBPSOSCA is used for data clustering problem on seven real-life datasets taken from the UCI machine learning store and gene expression model selector. The performance of proposed method is tested in comparison to original BPSO, modified BPSO with chaotic inertia weight (C-BPSO), binary moth flame optimization algorithm, binary dragonfly algorithm, binary whale optimization algorithm, SCA, and binary artificial bee colony algorithm. The conducted analysis demonstrates that the proposed method HBPSOSCA attain better performance in comparison to the competitive methods in most of the cases.

Optimization algorithms play a crucial role in solving complex challenges across various fields, including engineering, finance, and data science. This study introduces a novel hybrid optimization algorithm, the Hybrid Crayfish Optimization Algorithm with Differential Evolution (HCOADE), which addresses the limitations of premature convergence and inadequate exploitation in the traditional Crayfish Optimization Algorithm (COA). By integrating COA with Differential Evolution (DE) strategies, HCOADE leverages DE’s mutation and crossover mechanisms to enhance global optimization performance. The COA, inspired by the foraging and social behaviors of crayfish, provides a flexible framework for exploring the solution space, while DE’s robust strategies effectively exploit this space. To evaluate HCOADE’s performance, extensive experiments are conducted using 34 benchmark functions from CEC 2014 and CEC 2017, as well as six engineering design problems. The results are compared with ten leading optimization algorithms, including classical COA, Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Moth-flame Optimization (MFO), Salp Swarm Algorithm (SSA), Reptile Search Algorithm (RSA), Sine Cosine Algorithm (SCA), Constriction Coefficient-Based Particle Swarm Optimization Gravitational Search Algorithm (CPSOGSA), and Biogeography-based Optimization (BBO). The average rankings and results from the Wilcoxon Rank Sum Test provide a comprehensive comparison of HCOADE’s performance, clearly demonstrating its superiority. Furthermore, HCOADE’s performance is assessed on the CEC 2020 and CEC 2022 test suites, further confirming its effectiveness. A comparative analysis against notable winners from the CEC competitions, including LSHADEcnEpSin, LSHADESPACMA, and CMA-ES, using the CEC-2017 test suite, revealed superior results for HCOADE. This study underscores the advantages of integrating DE strategies with COA and offers valuable insights for addressing complex global optimization problems.

This paper introduces the Efficient Metaheuristic BitTorrent (EM-BT) algorithm, aimed at optimizing the placement and sizing of photovoltaic renewable energy sources (PVRES) and capacitor banks (CBs) in electric distribution networks. The main goal is to minimize energy losses and enhance voltage stability over 24 h, taking into account varying load profiles, solar irradiance, and temperature effects. The algorithm is rigorously tested on standard distribution networks, including the IEEE 33, IEEE 69, and ZB-ALG-Hassi Sida 157-bus systems. The results reveal that EM-BT outperforms established methods like Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), and Whale Optimization Algorithm (WOA), demonstrating its effectiveness in reducing energy losses and maintaining stable voltage profiles. By effectively combining PVRES and CBs, this research highlights a robust approach to enhancing both technical performance and operational reliability in distribution systems. Additionally, the consideration of temperature effects on PVRES efficiency adds depth to the study, making it a valuable contribution to the field of power system optimization.

PurposeOptimization involves changing the input parameters of a process that is experimented with different conditions to obtain the maximum or minimum result. Increasing interest is shown by antenna researchers in finding the optimum solution for designing complex antenna arrays which are possible by optimization techniques.Design/methodology/approachDesign of antenna array is a significant electro-magnetic problem of optimization in the current era. The philosophy of optimization is to find the best solution among several available alternatives. In an antenna array, energy is wasted due to side lobe levels which can be reduced by various optimization techniques. Currently, developing optimization techniques applicable for various types of antenna arrays is focused on by researchers.FindingsIn the paper, different optimization algorithms for reducing the side lobe level of the antenna array are presented. Specifically, genetic algorithm (GA), particle swarm optimization (PSO), ant colony optimization (ACO), cuckoo search algorithm (CSA), invasive weed optimization (IWO), whale optimization algorithm (WOA), fruitfly optimization algorithm (FOA), firefly algorithm (FA), cat swarm optimization (CSO), dragonfly algorithm (DA), enhanced firefly algorithm (EFA) and bat flower pollinator (BFP) are the most popular optimization techniques. Various metrics such as gain enhancement, reduction of side lobe, speed of convergence and the directivity of these algorithms are discussed. Faster convergence is provided by the GA which is used for genetic operator randomization. GA provides improved efficiency of computation with the extreme optimal result as well as outperforming other algorithms of optimization in finding the best solution.Originality/valueThe originality of the paper includes a study that reveals the usage of the different antennas and their importance in various applications.

Metaheuristic optimization methods; It is a well-known global optimization approach for large-scale search and optimization problems, commonly used to find the solution many different optimization problems. Slime mould optimization algorithm (SMA) is a recently presented metaheuristic technique that is inspired by the behavior of slime mould. Slow convergence speed is a fundamental problem in SMA as in other metaheuristic optimization methods. In order to improve the SMA method, 10 different chaotic maps have been applied for the first time in this article to generate chaotic values instead of random values in SMA. Using chaotic maps, it is aimed to increase the speed of SMA’s global convergence and prevent it from getting stuck in its local solutions. The Chaotic SMA (CSMA) proposed for the first time in this study was applied to 62 different benchmark functions. These are unimodal, multimodal, fixed dimension, CEC2019, and CEC2017 test suite. The results of the application have been comparatively analyzed and statistical analysis performed with the well-known metaheuristic optimization methods, particle swarm optimization and differential evolution algorithm, and recently proposed grey wolf optimization (GWO) and whale optimization algorithm (WOA). In addition, in the CEC2017 test suite, the CSMA method has been compared with the SMA, WOA, GWO, harris hawk optimization, archimedes optimization algorithm and COOT algorithms that have been proposed in recent years, and statistical analyzes have been made. In addition, CSMA has been tested in 3 different real-world engineering design problems. According to the experimental results, it was observed that CSMA achieved relatively more successful results in 62 different benchmark functions and real-world engineering design problems compared to other compared methods and standard SMA.

Addressing the insufficient optimization performance in drone 3D path planning and the issues of inadequate optimization precision and tendency to fall into local optima in the existing Whale Optimization Algorithm (WOA), this paper proposes a drone 3D path planning method based on an improved Whale Optimization Algorithm (CSRD-WOA). Firstly, to enhance the search efficiency and fitness accuracy of the Whale Algorithm, the Cuckoo Search and Random Differential Strategy were introduced and compared with the traditional Particle Swarm Optimization algorithm, Whale Algorithm, and Cuckoo Search Algorithm. Experimental results demonstrate that the CSRD-WOA algorithm improves global search capabilities and prevents premature convergence, significantly enhancing optimization precision and convergence speed. Secondly, applying the CSRD-WOA algorithm to drone 3D path planning issues, the simulation results show that the CSRD-WOA algorithm can effectively manage path planning in complex terrains, showcasing its application potential in drone path planning.