Search Results (29)

Multi-threshold image segmentation plays an irreplaceable role in extracting discriminative structural information from complex images. It is one of the core technologies for achieving accurate target detection and regional analysis, and its segmentation accuracy directly affects the analysis quality and decision reliability in key fields such as medical imaging, remote sensing interpretation, and industrial inspection. However, most existing image segmentation algorithms suffer from slow convergence speeds and low solution accuracy. Therefore, this paper proposes an Adaptive Cooperative Pelican Optimization Algorithm (ACPOA), an improved version of the Pelican Optimization Algorithm (POA), and applies it to global optimization and multilevel threshold image segmentation tasks. ACPOA integrates three innovative strategies: the elite pool mutation strategy guides the population toward high-quality regions by constructing an elite pool composed of the three individuals with the best fitness, effectively preventing the premature loss of population diversity; the adaptive cooperative mechanism enhances search efficiency in high-dimensional spaces by dynamically allocating subgroups and dimensions and performing specialized updates to achieve division of labor and global information sharing; and the hybrid boundary handling technique adopts a probabilistic hybrid approach to deal with boundary violations, balancing exploitation, exploration, and diversity while retaining more useful search information. Comparative experiments with eight advanced algorithms on the CEC2017 and CEC2022 benchmark test suites validate the superior optimization performance of ACPOA. Moreover, when applied to multilevel threshold image segmentation tasks, ACPOA demonstrates better accuracy, stability, and efficiency in solving practical problems, providing an effective solution for complex optimization challenges. 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

Wireless sensor networks (WSNs) are fundamental to applications in the Internet of Things, smart cities, and environmental monitoring, where coverage optimization is critical for maximizing monitoring efficacy under constrained resources. Conventional approaches often suffer from low global coverage efficiency, high computational overhead, and a tendency to converge to local optima. To address these challenges, this study proposes the fusion multi-strategy gray wolf optimizer (FMGWO), an advanced variant of the Gray Wolf Optimizer (GWO). FMGWO integrates various strategies: electrostatic field initialization for uniform population distribution, dynamic parameter adjustment with nonlinear convergence and differential evolution scaling, an elder council mechanism to preserve historical elite solutions, alpha wolf tenure inspection and rotation to maintain population vitality, and a hybrid mutation strategy combining differential evolution and Cauchy perturbations to enhance diversity and global search capability. Ablation studies validate the efficacy of each strategy, while simulation experiments demonstrate FMGWO’s superior performance in WSN coverage optimization. Compared to established algorithms such as PSO, GWO, CSA, DE, GA, FA, OGWO, DGWO1, and DGWO2, FMGWO achieves higher coverage rates with fewer nodes—up to 98.63% with 30 nodes—alongside improved convergence speed and stability. These results underscore FMGWO’s potential as an effective solution for efficient WSN deployment, offering significant implications for resource-constrained optimization in IoT and edge computing systems. Full article

The complexity of fake information and the inefficiency of parameter optimization in detection models present dual challenges for current detection technologies. Therefore, this paper proposes a hybrid detection model named MIBKA-CNN-BiLSTM, which significantly improves detection accuracy and efficiency through a triple-strategy enhancement of the Black Kite Optimization Algorithm (MIBKA) and an optimized dual-channel deep learning architecture. First, three improvements are introduced in the MIBKA. The population initialization process is restructured using circle chaotic mapping to enhance parameter space coverage. The conventional random perturbation is replaced by a random-to-elite differential mutation strategy (DE/rand-to-best/1) to balance global exploration and local exploitation. Moreover, a logarithmic spiral opposition-based learning (LSOBL) mechanism is integrated to dynamically explore the opposition solution space. Second, a CNN-BiLSTM dual-channel feature extraction network is constructed, with hyperparameters such as the number of convolutional kernels and LSTM units optimized by MIBKA to enable adaptive model structure alignment with task requirements. Finally, a high-quality fake information dataset is created based on social media platforms, including CCTV. The experimental results show that our model achieves the highest accuracy on the self-built dataset, which is 3.11% higher than the optimal hybrid model. Additionally, on the Weibo21 dataset, our model’s accuracy and F1-score increased by 1.52% and 1.71%, respectively, compared to the average values of all baseline models. These findings offer a practical and effective approach for detecting lightweight and robust false information. Full article

The aim was to investigate the genetic effects of a SNP located in the precursor region of gga-miR-3528. (1) Single-nucleotide polymorphisms within precursor regions of microRNAs play crucial biological roles. (2) Utilizing a Gushi–Anka F₂ resource population (n = 860), we screened and validated miRNA SNPs. A SNP mutation in the miR-3528 precursor region was identified. Specific primers were designed to amplify the polymorphic fragment. Genotyping was performed for this individual SNP across the population, using the MassArray system. Association analyses were conducted between this SNP and chicken growth and body measurement traits, carcass traits, meat quality traits, and serum enzyme activities. (3) The rs14098602 (+12 bp A > G) was identified within the precursor region of gga-miR-3528. Significant associations (p < 0.05) were observed between this SNP and chicken growth traits (body weight at the age of 0 day, body weight at the age of 2 weeks, and body weight at the age of 4 weeks), carcass traits (evisceration weight), meat quality traits (subcutaneous fat rate and pectoral muscle density), and serum enzyme activities (total protein, albumin, globulin, cholinesterase, and lactate dehydrogenase). (4) These findings suggest that the polymorphism at rs14098602 may influence chicken growth, meat quality, and serum biochemical indices, through specific mechanisms. The gga-miR-3528 gene likely plays an important role in chicken development. Therefore, this SNP can serve as a molecular marker for genetic breeding and auxiliary selection of growth-related traits, facilitating the rapid establishment of elite chicken populations with superior genetic resources. Full article

This paper presents a multi-strategy enhanced bald eagle search algorithm (EAB-BES) for 3D UAV path planning in urban environments. EAB-BES addresses key limitations of the traditional bald eagle search (BES) algorithm, including slow convergence, susceptibility to local optima, and poor adaptability in complex urban scenarios. The algorithm enhances solution space exploration through elite opposition-based learning, balances global search and local exploitation via an adaptive weight mechanism, and refines local search directions using block-based elite-guided differential mutation. These innovations significantly improve BES’s convergence speed, path accuracy, and adaptability to urban constraints. To validate its effectiveness, six high-density urban environments with varied obstacles were used for comparative experiments against nine advanced algorithms. The results demonstrate that EAB-BES achieves the fastest convergence speed and lowest stable fitness values and generates the shortest, smoothest collision-free 3D paths. Statistical tests and box plot analysis further confirm its superior performance in multiple performance metrics. EAB-BES has greater competitiveness compared with the comparative algorithms and can provide an efficient, reliable and robust solution for UAV autonomous navigation in complex urban environments. Full article

This paper presents an innovative optimization algorithm based on differential evolution that combines advanced mutation techniques with intelligent termination mechanisms. The proposed algorithm is designed to address the main limitations of classical differential evolution, offering improved performance for symmetric or non-symmetric optimization problems. The core scientific contribution of this research focuses on three key aspects. First, we develop a hybrid dual-strategy mutation system where the first strategy emphasizes exploration of the solution space through monitoring of the optimal solution, while the second strategy focuses on exploitation of promising regions using dynamically weighted differential terms. This dual mechanism ensures a balanced approach between discovering new solutions and improving existing ones. Second, the algorithm incorporates a novel majority dimension mechanism that evaluates candidate solutions through dimension-wise comparison with elite references (best sample and worst sample). This mechanism dynamically guides the search process by determining whether to intensify local exploitation or initiate global exploration based on majority voting across all the dimensions. Third, the work presents numerous new termination rules based on the quantitative evaluation of metric value homogeneity. These rules extend beyond traditional convergence checks by incorporating multidimensional criteria that consider both the solution distribution and evolutionary dynamics. This system enables more sophisticated and adaptive decision-making regarding the optimal stopping point of the optimization process. The methodology is validated through extensive experimental procedures covering a wide range of optimization problems. The results demonstrate significant improvements in both solution quality and computational efficiency, particularly for high-dimensional problems with numerous local optima. The research findings highlight the proposed algorithm’s potential as a high-performance tool for solving complex optimization challenges in contemporary scientific and technological contexts. Full article

High-dimensional complex optimization problems are pervasive in engineering and scientific computing, yet conventional algorithms struggle to meet collaborative optimization requirements due to computational complexity. While Chicken Swarm Optimization (CSO) demonstrates an intuitive understanding and straightforward implementation for low-dimensional problems, it suffers from limitations including a low convergence precision, uneven initial solution distribution, and premature convergence. This study proposes an Adaptive Dynamically Enhanced Variant of Chicken Swarm Optimization (ADVCSO) algorithm. First, to address the uneven initial solution distribution in the original algorithm, we design an elite perturbation initialization strategy based on good point sets, combining low-discrepancy sequences with Gaussian perturbations to significantly improve the search space coverage. Second, targeting the exploration–exploitation imbalance caused by fixed role proportions, a dynamic role allocation mechanism is developed, integrating cosine annealing strategies to adaptively regulate flock proportions and update cycles, thereby enhancing exploration efficiency. Finally, to mitigate the premature convergence induced by single update rules, hybrid mutation strategies are introduced through phased mutation operators and elite dimension inheritance mechanisms, effectively reducing premature convergence risks. Experiments demonstrate that the ADVCSO significantly outperforms state-of-the-art algorithms on 27 of 29 CEC2017 benchmark functions, achieving a 2–3 orders of magnitude improvement in convergence precision over basic CSO. In complex composite scenarios, its convergence accuracy approaches that of the championship algorithm JADE within a 10⁻² magnitude difference. For collaborative multi-subproblem optimization, the ADVCSO exhibits a superior performance in both Multiple Traveling Salesman Problems (MTSPs) and Multiple Knapsack Problems (MKPs), reducing the maximum path length in MTSPs by 6.0% to 358.27 units while enhancing the MKP optimal solution success rate by 62.5%. The proposed algorithm demonstrates an exceptional performance in combinatorial optimization and holds a significant engineering application value. Full article

To improve the global search efficiency and dynamic adaptability of the Sand Cat Swarm Optimization (SCSO) algorithm for UAV path planning in complex 3D environments, this study proposes a Modified Sand Cat Swarm Optimization (MSCSO) algorithm by integrating chaotic mapping initialization, Lévy flight–Metropolis hybrid exploration mechanisms, simulated annealing–particle swarm hybrid exploitation strategies, and elite mutation techniques. These strategies not only significantly enhance the convergence speed while ensuring algorithmic precision but also provide effective avenues for enhancing the performance of SCSO. We successfully apply these modifications to UAV path planning scenarios in complex environments. Experimental results on 18 benchmark functions demonstrate the enhanced convergence speed and stability of MSCSO. The proposed method has a superior performance in multimodal optimization tasks. The performance of MSCSO in eight complex scenarios that derived from real-world terrain data by comparing MSCSO with three state-of-the-art algorithms, MSCSO generates shorter average path lengths, reduces collision risks by 21–35%, and achieves higher computational efficiency. Its robustness in obstacle-dense and multi-waypoint environments confirms its practicality in engineering contexts. Overall, MSCSO demonstrates substantial potential in low-altitude resource exploration and emergency rescue operations. These innovative strategies offer theoretical and technical foundations for autonomous decision-making in intelligent unmanned systems. 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

With the advent of Industry 4.0, the seamless integration of industrial systems and unmanned technologies has significantly accelerated the development of smart industries. However, the research on task allocation for railway maintenance robots remains limited, particularly with respect to optimizing costs and efficiency within smart railway systems. To address this gap, the present study explores multi-robot task allocation for automated orbital bolt maintenance, aiming to enhance operational efficiency by minimizing both makespan and total travel distance for all robots. To achieve this, an improved hybrid algorithm combining NSGA-II and MOPSO is proposed. Initially, a dynamic task planning method, tailored to the specific conditions of railway operations, is developed. This method uses the coordinates of track bolts to extract environmental features, enabling the dynamic partitioning of task areas. Subsequently, a multi-elite archive strategy is introduced, along with an adaptive mechanism for adjusting crossover and mutation probabilities. This ensures the preservation and maintenance of multiple solutions across various Pareto fronts, effectively mitigating the premature convergence commonly observed in traditional NSGA-II algorithms. Moreover, the integration of the MOPSO algorithm strikes a balance between local and global search capabilities, thereby enhancing both optimization efficiency and solution quality. Finally, a series of experiments, conducted with varying task sizes and robot quantities during the railway maintenance window, validate the effectiveness and improved performance of the proposed algorithm in addressing the multi-robot task allocation problem. 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

The pathfinder algorithm (PFA) starts with a random search for the initial population, which is then partitioned into only a pathfinder phase and a follower phase. This approach often results in issues like poor solution accuracy, slow convergence, and susceptibility to local optima in the PFA. To address these challenges, a multi-strategy fusion approach is proposed in the symmetry-enhanced, improved pathfinder algorithm-based multi-strategy fusion for engineering optimization problems (IPFA) for function optimization problems. First, the elite opposition-based learning mechanism is incorporated to improve the population diversity and population quality, to enhance the solution accuracy of the algorithm; second, to enhance the convergence speed of the algorithm, the escape energy factor is embedded into the prey-hunting phase of the GWO and replaces the follower phase in the PFA, which increases the diversity of the algorithm and improves the search efficiency of the algorithm; lastly, to solve the problem of easily falling into the local optimum, the optimal individual position is perturbed using the dimension-by-dimension mutation method of t-distribution, which helps the individual to jump out of the local optimum rapidly and advance toward other regions. The IPFA is used for testing on 16 classical benchmark test functions and 29 complex CEC2017 function sets. The final optimization results of PFA and IPFA in pressure vessels are 5984.8222 and 5948.3597, respectively. The final optimization results in tension springs are 0.012719 and 0.012699, respectively, which are comparable with the original algorithm and other algorithms. A comparison between the original algorithm and other algorithms shows that the IPFA algorithm is significantly enhanced in terms of solution accuracy, and the lower engineering cost further verifies the robustness of the IPFA algorithm. Full article

Clinical differentiation between athletes’ hearts and those with hypertrophic cardiomyopathy (HCM) can be challenging. We aimed to explore the role of speckle tracking echocardiography (STE) and cardiac magnetic resonance imaging (CMR) in the differentiation between athletes’ hearts and those with mild HCM. We compared 30 competitive endurance elite athletes (7% female, age 41 ± 9 years) and 20 mild phenotypic mutation-positive HCM carriers (15% female, age 51 ± 12 years) with left ventricular wall thickness 13 ± 1 mm. Mechanical dispersion (MD) was assessed by means of STE. Native T1-time and extracellular volume (ECV) were assessed by means of CMR. MD was higher in HCM mutation carriers than in athletes (54 ± 16 ms vs. 40 ± 11 ms, p = 0.001). Athletes had a lower native T1-time (1204 (IQR 1191, 1234) ms vs. 1265 (IQR 1255, 1312) ms, p < 0.001) and lower ECV (22.7 ± 3.2% vs. 25.6 ± 4.1%, p = 0.01). MD > 44 ms optimally discriminated between athletes and HCM mutation carriers (AUC 0.78, 95% CI 0.65–0.91). Among the CMR parameters, the native T1-time had the best discriminatory ability, identifying all HCM mutation carriers (100% sensitivity) with a specificity of 75% (AUC 0.83, 95% CI 0.71–0.96) using a native T1-time > 1230 ms as the cutoff. STE and CMR tissue characterization may be tools that can differentiate athletes’ hearts from those with mild HCM. Full article

The proper dispatching of hydraulic structures in water diversion projects is a desirable way to maximize project benefits. This study aims to provide a reliable, optimal scheduling model for hydraulic engineering to improve the regional water environment. We proposed an improved gravitational search algorithm (IPSOGSA) based on multi-strategy hybrid technology to solve this practical problem. The opposition-based learning strategy, elite mutation strategy, local search strategy, and co-evolution strategies were employed to balance the exploration and exploitation of the algorithm through the adaptive evolution of the elite group. Compared with several other algorithms, the preponderance of the proposed algorithm in single-objective optimization problems was demonstrated. We combined the water quality mechanism model, an artificial neural network (ANN), and the proposed algorithm to establish the optimal scheduling model for hydraulic structures. The backpropagation neural network (IGSA-BPNN) trained by the improved algorithm has a high accuracy, with a coefficient of determination (R²) over 0.95. Compared to the two traditional algorithms, the IGSA-BPNN model was, respectively, improved by 1.5% and 0.9% on R² in the train dataset, and 1.1% and 1.5% in the test dataset. The optimal scheduling model for hydraulic structures led to a reduction of 46~69% in total power consumption while achieving the water quality objectives. With the lowest cost scheme in practice, the proposed intelligent scheduling model is recommended for water diversion projects in plain river networks. Full article