Search Results (45)

The basic Salp Swarm Algorithm (SSA) offers advantages such as a simple structure and few parameters. However, it is prone to falling into local optima and remains inadequate for seed classification tasks that involve hyperparameter optimization of machine learning classifiers such as Support Vector Machines (SVMs). To overcome these limitations, an Enhanced Knowledge-based Salp Swarm Algorithm (EKSSA) is proposed. The EKSSA incorporates three key strategies: Adaptive adjustment mechanisms for parameters $c_1$ and $\alpha$ to better balance exploration and exploitation within the salp population; a Gaussian walk-based position update strategy after the initial update phase, enhancing the global search ability of individuals; and a dynamic mirror learning strategy that expands the search domain through solution mirroring, thereby strengthening local search capability. The proposed algorithm was evaluated on thirty-two CEC benchmark functions, where it demonstrated superior performance compared to eight state-of-the-art algorithms, including Randomized Particle Swarm Optimizer (RPSO), Grey Wolf Optimizer (GWO), Archimedes Optimization Algorithm (AOA), Hybrid Particle Swarm Butterfly Algorithm (HPSBA), Aquila Optimizer (AO), Honey Badger Algorithm (HBA), Salp Swarm Algorithm (SSA), and Sine–Cosine Quantum Salp Swarm Algorithm (SCQSSA). Furthermore, an EKSSA-SVM hybrid classifier was developed for seed classification, achieving higher classification accuracy. Full article

The Honey Badger Algorithm (HBA) is a recently proposed metaheuristic optimization algorithm inspired by the foraging behavior of honey badgers. The search mechanism of this algorithm is divided into two phases: a mining phase and a honey-seeking phase, effectively emulating the processes of exploration and exploitation within the search space. Despite its innovative approach, the Honey Badger Algorithm (HBA) faces challenges such as slow convergence rates, an imbalanced trade-off between exploration and exploitation, and a tendency to become trapped in local optima. To address these issues, we propose an enhanced version of the Honey Badger Algorithm (HBA), namely the Multi-Strategy Honey Badger Algorithm (MSHBA), which incorporates a Cubic Chaotic Mapping mechanism for population initialization. This integration aims to enhance the uniformity and diversity of the initial population distribution. In the mining and honey-seeking stages, the position of the honey badger is updated based on the best fitness value within the population. This strategy may lead to premature convergence due to population aggregation around the fittest individual. To counteract this tendency and enhance the algorithm’s global optimization capability, we introduce a random search strategy. Furthermore, an elite tangential search and a differential mutation strategy are employed after three iterations without detecting a new best value in the population, thereby enhancing the algorithm’s efficacy. A comprehensive performance evaluation, conducted across a suite of established benchmark functions, reveals that the MSHBA excels in 26 out of 29 IEEE CEC 2017 benchmarks. Subsequent statistical analysis corroborates the superior performance of the MSHBA. Moreover, the MSHBA has been successfully applied to four engineering design problems, highlighting its capability for addressing constrained engineering design challenges and outperforming other optimization algorithms in this domain. Full article

To address the limitations of mobile robots in path planning within farmland-specific environments, this paper proposes a biomimetic model: Multi-strategy Collaborative Evolution Honey Badger Algorithm (MCEHBA), MCEHBA achieves improvements through the following strategies: firstly, integrating a sinusoidal function-based nonlinear convergence factor to dynamically balance global exploration and local exploitation; secondly, combining the differential evolution strategy to enhance population diversity, and utilizing gravity-centred opposition-based learning to improve solution space search efficiency; finally, constructing good point set initialization and decentralized boundary constraint handling strategy to further increase convergence accuracy and speed. This paper validates the effectiveness of the optimization strategy and the performance of MCEHBA through the CEC2017 benchmark function set, and assesses the statistical significance of the results using the Friedman test and Nemenyi test. The findings demonstrate that MCEHBA exhibits excellent optimization capabilities. Additionally, this study applied MCEHBA to solve three engineering application problems and compared its results with six other algorithms, showing that MCEHBA achieved the minimum objective function values in all three cases. Finally, simulation experiments were conducted in three farmland scenarios of varying scales, with comparative tests against three state-of-the-art algorithms. The results indicate that MCEHBA generates paths with minimized total costs, demonstrating superior global convergence and engineering applicability. Full article

With the advancement of Agriculture 4.0, intelligent systems and data-driven technologies offer new opportunities for pork supply-demand balance regulation, while also confronting challenges such as production cycle fluctuations and epidemic outbreaks. This paper introduces a knowledge-driven smart system for pork supply-demand regulation, which integrates essential components including a knowledge base, a mathematical-model-based expert system, an enhanced optimization framework, and a real-time feedback mechanism. Around the core of the system, a nonlinear constrained optimization model is established, which uses adjustments to newly retained gilts as decision variables and minimizes supply-demand squared errors as its objective function, incorporating multi-dimensional factors such as pig growth dynamics, epidemic impacts, consumption trends, and international trade into its analytical framework. By harnessing dynamic decision-making capabilities of reinforcement learning (RL), we design an optimization architecture centered on the Q-learning mechanism and dual-strategy pools, which is integrated into the honey badger algorithm to form the RL-enhanced honey badger algorithm (RLEHBA). This innovation achieves an efficient balance between exploration and exploitation in model solving and improves system adaptability. Numerical experiments demonstrate RLEHBA’s superior performance over State-of-the-Art algorithms on the CEC 2017 benchmark. A case study of China’s 2026 pork regulation confirms the system’s practical value in stabilizing the supply-demand balance and optimizing resource allocation. Finally, some targeted managerial insights are proposed. This study constructs a replicable framework for intelligent livestock regulation, and it also holds transformative significance for sustainable and adaptive supply chain management in global agri-food systems. Full article

The honey badger algorithm (HBA) has gained significant attention as a metaheuristic optimization method; however, despite these design strengths, it still faces challenges such as premature convergence, suboptimal exploration–exploitation balance, and low population diversity. To address these limitations, we integrate a power-law degree distribution (PDD) topology into the HBA population structure. Three improved versions of the HBA are proposed, with each employing different population update strategies: PDDHBA-R, PDDHBA-B, and PDDHBA-H. In the PDDHBA-R strategy, individuals randomly select neighbours as references, promoting diversity and randomness. The PDDHBA-B strategy allows individuals to select the best neighbouring individual, speeding up convergence. The PDDHBA-H strategy combines both approaches, using random selection for elite individuals and best selection for non-elite individuals. These algorithms were tested on 30 benchmark functions from CEC2017, 21 real-world problems from CEC2011, and four constrained engineering problems. The experimental results show that all three improvements significantly improve the performance of the HBA, with PDDHBA-H delivering the best results across various tests. Further analysis of the parameter sensitivity, computational complexity, population diversity, and exploration–exploitation balance confirms the superiority of PDDHBA-H, highlighting its potential for use in complex optimization problems. Full article

This paper presents the optimal sizing of a hybrid renewable energy system (HRES) for an isolated residential building using modified smell agent optimization (mSAO). The paper introduces a time-dependent approach that adapts the selection of the original SAO control parameters as the algorithm progresses through the optimization hyperspace. This modification addresses issues of poor convergence and suboptimal search in the original algorithm. Both the modified and standard algorithms were employed to design an HRES system comprising photovoltaic panels, wind turbines, fuel cells, batteries, and hydrogen storage, all connected via a DC-bus microgrid. The components were integrated with the microgrid using DC-DC power converters and supplied a designated load through a DC-AC inverter. Multiple operational scenarios and multi-objective criteria, including techno-economic metrics such as levelized cost of energy (LCOE) and loss of power supply probability (LPSP), were evaluated. Comparative analysis demonstrated that mSAO outperforms the standard SAO and the honey badger algorithm (HBA) used for the purpose of comparison only. Our simulation results highlighted that the PV–wind turbine–battery system achieved the best economic performance. In this case, the mSAO reduced the LPSP by approximately 38.89% and 87.50% over SAO and the HBA, respectively. Similarly, the mSAO also recorded LCOE performance superiority of 4.05% and 28.44% over SAO and the HBA, respectively. These results underscore the superiority of the mSAO in solving optimization problems. Full article

Existing smart contract honeypot detection approaches exhibit high false negatives and positives due to (i) their inability to generate transaction sequences triggering order-dependent traps and (ii) their limited code coverage from traditional fuzzing’s random mutations. In this paper, we propose a hybrid fuzzing framework for smart contract honeypot detection based on taint analysis, SCH-Hunter. SCH-Hunter conducts source-code-level feature analysis of smart contracts and extracts data dependency relationships between variables from the generated Control Flow Graph to construct specific transaction sequences for fuzzing. A symbolic execution module is also introduced to resolve complex conditional branches that fuzzing alone fails to penetrate, enabling constraint solving. Furthermore, real-time dynamic taint propagation monitoring is implemented using taint analysis techniques, leveraging taint flow information to optimize seed mutation processes, thereby directing mutation resources toward high-value code regions. Finally, by integrating EVM (Ethereum Virtual Machine) code instrumentation with taint information flow analysis, the framework effectively identifies and detects security-sensitive operations, ultimately generating a comprehensive detection report. Empirical results are as follows. (i) For code coverage, SCH-Hunter performs better than the state-of-art tool, HoneyBadger, achieving higher average code coverage rates on both datasets, surpassing it by 4.79% and 17.41%, respectively. (ii) For detection capabilities, SCH-Hunter is not only roughly on par with HoneyBadger in terms of precision and recall rate but also capable of detecting a wider variety of smart contract honeypot techniques. (iii) For the evaluation of components, we conducted three ablation studies to demonstrate that the proposed modules in SCH-Hunter significantly improve the framework’s detection capability, code coverage, and detection efficiency, respectively. Full article

This paper shows that lithium-ion battery model parameters are vital for state-of-health assessment and performance optimization. Traditional evolutionary algorithms often fail to balance global and local search. To address these challenges, this study proposes the Elite Opposition-Based Learning Snake Optimization (EOLSO) algorithm, which uses an elite opposition-based learning mechanism to enhance diversity and a non-monotonic temperature factor to balance exploration and exploitation. The algorithm is applied to the parameter identification of the second-order RC equivalent circuit model. EOLSO outperforms some traditional optimization methods, including the Gray Wolf Optimizer (GWO), Honey Badger Algorithm (HBA), Golden Jackal Optimizer (GJO), Enhanced Snake Optimizer (ESO), and Snake Optimizer (SO), in both standard functions and HPPC experiments. The experimental results demonstrate that EOLSO significantly outperforms the SO, achieving reductions of 43.83% in the Sum of Squares Error (SSE), 30.73% in the Mean Absolute Error (MAE), and 25.05% in the Root Mean Square Error (RMSE). These findings position EOLSO as a promising tool for lithium-ion battery modeling and state estimation. It also shows potential applications in battery management systems, electric vehicle energy management, and other complex optimization problems. The code of EOLSO is available on GitHub. Full article

To address the challenges of low optimization efficiency and premature convergence in existing algorithms for unmanned aerial vehicle (UAV) 3D path planning under complex operational constraints, this study proposes an enhanced honey badger algorithm (LRMHBA). First, a three-dimensional terrain model incorporating threat sources and UAV constraints is constructed to reflect the actual operational environment. Second, LRMHBA improves global search efficiency by optimizing the initial population distribution through the integration of Latin hypercube sampling and an elite population strategy. Subsequently, a stochastic perturbation mechanism is introduced to facilitate the escape from local optima. Furthermore, to adapt to the evolving exploration requirements during the optimization process, LRMHBA employs a differential mutation strategy tailored to populations with different fitness values, utilizing elite individuals from the initialization stage to guide the mutation process. This design forms a two-population cooperative mechanism that enhances the balance between exploration and exploitation, thereby improving convergence accuracy. Experimental evaluations on the CEC2017 benchmark suite demonstrate the superiority of LRMHBA over 11 comparison algorithms. In the UAV 3D path planning task, LRMHBA consistently generated the shortest average path across three obstacle simulation scenarios of varying complexity, achieving the highest rank in the Friedman test. Full article

The P-V and I-V curves of photovoltaic (PV) strings show multiple peaks when exposed to partial shading conditions (PSCs). The traditional maximum power point tracking (MPPT) method cannot track the global maximum power point (GMPP) due to the multi-peak characteristics, power fluctuation, and tracking speed. In this paper, a multi-peak PV MPPT method based on the honey badger algorithm (HBA) is proposed to track the GMPP in a localized shading environment. The performance of this method is also compared and analyzed with the traditional MPPT methods based on the perturbation observation (P&O) method and Particle Swarm Optimization (PSO) algorithm. The experimental results have proven that, compared with the MPPT methods based on P&O and PSO, the proposed multi-peak MPPT method based on the HBA algorithm has a faster tracking speed, higher tracking accuracy, and fewer iterations. Full article

A photovoltaic array fault diagnosis method based on an improved honey badger optimization algorithm is proposed to improve the accuracy of photovoltaic array fault diagnosis. Firstly, analyze the current and power output characteristic curves of the photovoltaic array under different states, and construct a preliminary set of 10 dimensional fault feature vectors. Secondly, the feature vector set is ranked in importance using the random forest algorithm, and then input into support vector machines, long short-term memory, and bidirectional long short-term memory neural networks to obtain the optimal combination of the base model and the number of features. Then, the honey badger optimization algorithm was improved by combining Tent chaotic mapping column measurement, improved control factors, and pinhole imaging strategy, and compared with other optimization algorithms to demonstrate its effectiveness in optimization ability, stability, and convergence speed. Finally, by combining the improved honey badger optimization algorithm with the optimal base model and number of features, the problem of hyperparameter setting in the base model was effectively solved. The experimental results show that the fault diagnosis accuracy of the proposed photovoltaic array fault diagnosis model is 97.1014%, which is superior to other models and verifies the effectiveness of the proposed method. Full article

Aiming at the problem that the honey badger algorithm easily falls into local convergence, insufficient global search ability, and low convergence speed, this paper proposes a global optimization honey badger algorithm (Global Optimization HBA) (GOHBA), which improves the search ability of the population, with better ability to jump out of the local optimum, faster convergence speed, and better stability. The introduction of Tent chaotic mapping initialization enhances the population diversity and initializes the population quality of the HBA. Replacing the density factor enhances the search range of the algorithm in the entire solution space and avoids premature convergence to a local optimum. The addition of the golden sine strategy enhances the global search capability of the HBA and accelerates the convergence speed. Compared with seven algorithms, the GOHBA achieves the optimal mean value on 14 of the 23 tested functions. On two real-world engineering design problems, the GOHBA was optimal. On three path planning problems, the GOHBA had higher accuracy and faster convergence. The above experimental results show that the performance of the GOHBA is indeed excellent. Full article

This paper presents a critique of the Honey Badger Algorithm (HBA) with regard to its limited exploitation capabilities, susceptibility to local optima, and inadequate pre-exploration mechanisms. In order to address these issues, we propose the Improved Honey Badger Algorithm (IHBA), which integrates the Elite Tangent Search Algorithm (ETSA) and differential mutation strategies. Our approach employs cubic chaotic mapping in the initialization phase and a random value perturbation strategy in the pre-iterative stage to enhance exploration and prevent premature convergence. In the event that the optimal population value remains unaltered across three iterations, the elite tangent search with differential variation is employed to accelerate convergence and enhance precision. Comparative experiments on partial CEC2017 test functions demonstrate that the IHBA achieves faster convergence, greater accuracy, and improved robustness. Moreover, the IHBA is applied to the fault diagnosis of rolling bearings in electric motors to construct the IHBA-VMD-CNN-BiLSTM fault diagnosis model, which quickly and accurately identifies fault types. Experimental verification confirms that this method enhances the speed and accuracy of rolling bearing fault identification compared to traditional approaches. Full article

As big data continues to evolve, cluster analysis still has a place. Among them, the K-means algorithm is the most widely used method in the field of clustering, which can cause unstable clustering results due to the random selection of the initial clustering center of mass. In this paper, an improved honey badger optimization algorithm is proposed: (1) The population is initialized using sin chaos to make the population uniformly distributed. (2) The density factor is improved to enhance the optimization accuracy of the population. (3) A nonlinear inertia weight factor is introduced to prevent honey badger individuals from relying on the behavior of past individuals during position updating. (4) To improve the diversity of solutions, random opposition learning is performed on the optimal individuals. The improved algorithm outperforms the comparison algorithm in terms of performance through experiments on 23 benchmark test functions. Finally, in this paper, the improved algorithm is applied to K-means clustering and experiments are conducted on three data sets from the UCI data set. The results show that the improved honey badger optimized K-means algorithm improves the clustering effect over the traditional K-means algorithm. Full article

A well-planned schedule is essential to any organization’s growth. Thus, it is important for the literature to cover a more comprehensive range of scheduling problems. In this paper, energy-efficient hybrid flow shop (EEHFS) scheduling problems are considered. Researchers have developed several techniques to deal with EEHFS scheduling problems. Also, researchers have recently proposed several metaheuristics. Honey Badger Algorithm (HBA) is one of the most recent algorithms proposed to solve various optimization problems. The objective of the present work is to solve EEHFS scheduling problems using the Hybrid Honey Badger Algorithm (HHBA) to reduce the makespan (Cmax) and total energy cost (TEC). In the HHBA, a constructive heuristic known as the NEH heuristic was incorporated with the Honey Badger Algorithm. The suggested algorithm’s performance was verified using an actual industrial scheduling problem. The company’s results are compared with those of the HHBA. The HHBA could potentially result in an 8% decrease in total energy cost. Then, the proposed algorithm was applied to solve 54 random benchmark problems. The results of the proposed HHBA were compared with the FIFO dispatching rule, the NEH heuristic, and other metaheuristics such as the simulated annealing (SA) algorithm, the genetic algorithm (GA), the particle swarm optimization (PSO) algorithm, Honey Badger Algorithm, and the Ant Colony Optimization (ACO) algorithms addressed in the literature. Average percentage deviation (APD) was the performance measure used to compare different algorithms. The APD of the proposed HHBA was zero. This indicates that the proposed HHBA is more effective in solving EEHFS scheduling problems. Full article