Search Results (1,385)

Two reconstruction methods for constraint and load parameters of aero-engine pipelines based on intelligent optimization algorithms are proposed in this paper. First, a simplified finite element model (FEM) of the aero-engine pipeline structure is established, and its reliability is validated by comparing simulation data with experimental data. Second, a reconstruction algorithm for spring constraint parameters and pipeline load parameters based on the improved particle swarm optimization (IPSO) algorithm is developed on the MATLAB data analysis and ANSYS simulation platforms, which completes the reconstruction calculation of parameters such as spring constraint stiffness and applied harmonic excitation. For harmonic excitation parameter reconstruction, the maximum error of this algorithm reaches 24.9%, revealing its significant inapplicability to load parameter reconstruction. To solve this problem, a load reconstruction method based on the conjugate gradient method (CGM) is further proposed to achieve accurate reconstruction of pipeline load parameters, which mitigates the large reconstruction error of the IPSO algorithm under working conditions with multiple loads. Under 5% noise interference, the maximum error of the CGM is merely 5.16%. Finally, experimental verification of harmonic excitation amplitude reconstruction is performed using the CGM with lower reconstruction errors. Experimental results indicate that the maximum error is 14.24% for harmonic excitation amplitude reconstruction, which verifies the high applicability of the conjugate gradient algorithm to load reconstruction of aero-engine pipelines. Full article

In the context of an increasingly complex and dynamic digital ecosystem, accurately assessing the value of Specialized, Refined, Differentiated, and Innovative (SRDI) enterprises is crucial for making effective decisions. Traditional valuation methods struggle to effectively address issues such as the high R&D expenditures and significant operational risks associated with these enterprises. This study proposes an interpretable intelligent decision-support framework for valuing SRDI enterprises listed on the Beijing Stock Exchange (BSE), constructing a multidimensional indicator system that encompasses solvency, profitability, and R&D capabilities. Feature importance screening using the XGBoost algorithm was conducted to identify key indicators as input variables for a backpropagation (BP) neural network. Concurrently, the Particle Swarm Optimization (PSO) algorithm was applied to the neural network to optimize initial weights and thresholds, thereby modeling nonlinear valuation relationships. Empirical analysis of 770 SRDI firms listed on the Beijing Stock Exchange from 2020 to 2024 indicates that the XGBoost-PSO-BPNN model achieved a coefficient of determination of 0.8083 on the test set, outperforming traditional linear models and benchmark models such as single-tree models. SHAP explainability analysis further reveals that current asset turnover, return on assets, and equity concentration are the primary value drivers. This study employs various clustering methods to further classify enterprises into three categories and proposes recommendations for differentiated regulatory policies, providing intelligent decision support for enterprises operating within complex digital ecosystems. Full article

A novel hybrid ISSA-GWO (Improved Sparrow Search Algorithm–Grey Wolf Optimizer) is proposed for the path planning of Unmanned Wing-in-Ground-Effect Craft (UWIGC), integrating ground-effect constraints and island-reef environments into a unified optimization framework. Leveraging its exceptional ultra-low-altitude flight capability and high economic efficiency, the UWIGC offers unique advantages in maritime missions such as island patrol and rapid replenishment. However, its path planning faces the dual challenge of precise obstacle avoidance and ultra-low-altitude maintenance, due to the obstacle distribution in island regions and the altitude window constraints inherent to ground-effect flight. To address this, the proposed method integrates the swarm intelligence of the Sparrow Search Algorithm and employs a self-destruction mechanism to escape local optima. Furthermore, it combines the hierarchical guidance of the Grey Wolf Optimizer to enhance convergence accuracy. The algorithm incorporates ground-effect maintenance constraints and an island-reef threat model, and it smooths the final path using cubic B-spline curves. Simulation results demonstrate that the proposed algorithm outperforms the standard Sparrow Search Algorithm, Grey Wolf Optimizer, and Particle Swarm Optimization in terms of convergence speed, optimization accuracy, and obstacle avoidance success rate. It is capable of generating a feasible, safe, and smooth path, thereby supporting the autonomous navigation of UWIGC in island reef waters. Full article

Complex networks have become a fundamental paradigm for modeling real-world systems. Synchronization of such networks, particularly under hyperchaotic dynamics, presents a significant control challenge due to the high-dimensional state space and multiple positive Lyapunov exponents. This paper addresses the driver node selection problem in a 4D Hyperchaotic Lorenz complex network, formulating it as a constrained binary optimization task. We evaluate a pool of advanced metaheuristics, including the quantum genetic algorithm (QGA), seahorse optimizer (SHO), and artificial bee colony (ABC), across multiple network experiments conducted over 30 independent runs to guarantee statistical validity. The performance of these solvers is rigorously benchmarked against traditional topological heuristics, a random selection baseline comprising 600 feasible configurations, and verified through Wilcoxon statistical testing. Furthermore, addressing computational sustainability, we introduce a “Green-Artificial Intelligence” architecture based on dual-tier structured query language memoization (SQL-memoization) and provide a detailed runtime comparison evaluating its efficiency. The empirical results indicate that swarm-intelligence methods such as ABC and SHO exhibit robust competitive performance in minimizing synchronization errors while the Green-AI framework consistently and drastically reduces the computation of the repetitive simulations. Full article

To address the problems of false negatives, false positives, and delayed response in traditional fire detection systems, this paper proposes a warehouse fire detection scheme based on multi-sensor information fusion. By constructing a ZigBee wireless sensor network and integrating temperature, CO concentration and smoke sensors, fire simulation data are collected in the warehouse. At the data processing level, an improved Grubbs criterion is innovatively adopted to eliminate outliers, and the median is used instead of the average to effectively suppress the same-side shielding effect. At the feature layer fusion stage, a BP neural network model optimized by the cosine decreasing inertia weight particle swarm optimization algorithm (CIW-PSO) is designed. By dynamically adjusting the learning factors (c₁, c₂) and inertia weight (w), the convergence speed and global optimization ability are significantly improved. At the decision-making level, a fuzzy logic reasoning mechanism is introduced to integrate multi-parameter membership functions, thereby reducing the probability of misjudgment. Field tests have verified that the system can achieve early fire warning in a 50 m × 100 m warehouse environment, with a false alarm rate reduced by 42% compared to a single sensor and a response time shortened by 35%, providing an efficient and reliable intelligent solution for warehouse fire safety. Full article

For microbiological diagnostics, accurately counting and segmenting microbial colonies is extremely important. However, manual methods are labor-intensive and yield inconsistent results. We develop a hybrid model using swarm intelligence, combining a convolutional transformer with nested skip connections and global context with channel and spatial attention. Parameter tuning is supported by a variety of swarm optimization algorithms (e.g., Particle Swarm Optimization, Quantum-behaved Particle Swarm Optimization, and Differential Evolution Particle Swarm Optimization). Morphological refinement, including a further watershed transform, an attention graph, and post-processing, enhances colony boundaries by separating them. Grad-CAM++, Integrated Gradients, and temperature scaling provide a transparent and trustworthy model through explainability and post hoc calibration. The proposed model was extensively tested on the Microbial Colony Recognition and Circular Bacterial Colony Datasets, achieving a Dice score of 94.2%, an Intersection over the Union of 88.6%, and a mean absolute counting error of 2.7 colonies. These results significantly outperform several baseline models, including U-Net (88.1%), U-Net++ (89.7%), Attention U-Net (90.6%), and Swin-Unet (91.4%). Statistically significant improvements were confirmed (p < 0.01). A cross-dataset analysis demonstrates the framework’s robustness and cross-domain applicability, and positions it as a trustworthy, explainable automated model for assessing microbial colonies in laboratory and clinical settings. Full article

As the search for sustainable energy solutions increases, Photovoltaic (PV) panels have emerged as a crucial technology, harnessing solar energy to meet the growing global demand. These devices require maximum power point tracking (MPPT) for efficient operation as a consequence of their nonlinear electrical behavior. These nonlinearities cause traditional algorithms to be less than fully effective, thus creating room for improvement that can be filled by intelligent algorithm proposals, such as Particle Swarm Optimization (PSO). In this context, a new variant of the PSO algorithm based on evolutionary behavior and voltage window restrictions is presented, implemented, and validated with the aim of developing an advanced control system to operate in a real PV system for MPPT. The study covers several experiments comparing its performance with other PSO variants found in the literature. The proposed algorithm exhibits smoother transitions with fewer power shocks due to a restricted voltage window, ensuring rapid convergence through its evolutionary feature. These improvements lead to a significant reduction in energy losses during the search process, dropping from about 3.76% with the standard PSO to only 2.56%, while also halving the convergence time. Full article

Establishing an energy-balanced data routing and clustering approach is among the most fundamental steps to extend the longevity of wireless sensor networks (WSNs). This study presents an intelligent and energy-aware framework for data routing and clustering in WSN employing an adjusted Rand index (ARI)-guided discrete particle swarm optimization algorithm: ARI-DPSO. This method uses Dijkstra’s algorithm to establish energy-efficient data paths and uses the network lifetime as the ARI-DPSO’s fitness function. The discrete particle swarm optimization searches for the globally optimal cluster configuration that extends the network’s operational lifetime. The novelty of the ARI-DPSO lies in its capability to avoid premature convergence by using the ARI metric to quantify the similarity between the swarm’s global best solution and the current particles. Based on this level of similarity, ARI-DPSO employs an ARI-derived mechanism to trigger a dynamic perturbation element to force the swarm of particles to explore new search areas. The simulation results show that the ARI-DPSO improves the dynamics and diversity of the swarm, thereby maximizing the stable operational lifetime of wireless sensor networks (first node death). Full article

Dual 6 degrees of freedom (6-DOF) series-parallel cooperative robot actuators are core execution components in modern intelligent manufacturing systems, which are widely used in high-end manufacturing scenarios such as aerospace precision assembly, laser precision machining, and core component assembly of new energy vehicles. However, in actual manufacturing processes, the pose deviation between theoretical model prediction and actual motion execution of the actuator, caused by kinematic model mismatch, unquantified core parameters, incomplete error processing chain, and complex on-site environmental interference, severely restricts the assembly accuracy, product qualification rate and production efficiency of the manufacturing system. To address these critical pain points of robot actuators in precision manufacturing systems, this paper proposes a four-layer hierarchical decoupling multi-modal fusion calibration algorithm for high-precision pose control of dual series-parallel robot actuators. The algorithm integrates singular value decomposition (SVD) for cross-structure coordinate alignment of heterogeneous actuators, chaotic mapping-enhanced particle swarm optimization (PSO) for nonlinear error suppression of the actuator system, attention-enhanced deep residual network (DRN) for unmodeled residual learning of the actuator, and Kalman filter (KF) for dynamic noise reduction in the manufacturing process. Meanwhile, a full-chain error transfer model of the actuator system in the manufacturing process is constructed, and the core parameters of the algorithm are quantified via dimensional sensitivity analysis and orthogonal experiments. Experimental results show that the static position error of the actuator system after calibration reaches 1.4 ± 0.08 mm, and the static pose error reaches 0.0059 ± 0.0003 rad in the laboratory environment; in the engineering application of laser precision machining in an actual manufacturing line, the position error and pose error only increase by 8.6% and 6.8% respectively, maintaining high stability in industrial manufacturing scenarios. Compared with mainstream calibration methods, the proposed algorithm reduces the position error and pose error of the actuator by up to 55.7% and 17.9% respectively, with lower computational complexity and higher engineering reproducibility. This work constructs an end-to-end error suppression chain with quantitative parameter criteria for the series-parallel actuator system in manufacturing systems, which provides a reliable high-precision calibration solution for industrial dual-robot cooperative manufacturing and has important guiding significance for improving the motion accuracy and operation stability of actuators in precision manufacturing systems. Full article

Hybrid Evolutionary–Fuzzy Systems (HEFS) have emerged as a powerful computational paradigm for addressing complex engineering optimization and intelligent decision-making problems under uncertainty. This study presents a systematic review, conducted following the PRISMA 2020 methodology, to analyze advancements in the integration of evolutionary algorithms, swarm intelligence, fuzzy logic, and Multi-Criteria Decision-Making (MCDM) techniques over the period 2020–2026. The analysis focuses on identifying key algorithmic mechanisms, hybridization strategies, performance metrics, and application domains. The results indicate that HEFSs significantly enhance optimization performance by balancing exploration and exploitation, improving robustness, and enabling adaptive and interpretable decision-making in uncertain and multi-objective environments. In particular, fuzzy systems contribute to effective uncertainty modeling and interpretability, while evolutionary and metaheuristic algorithms provide strong global search capabilities. Despite these advantages, important challenges remain, including high computational complexity, scalability limitations, and the trade-off between accuracy and interpretability. The review also identifies emerging research directions involving Explainable Artificial Intelligence (XAI), deep learning integration, digital twins, and big-data-enabled optimization. However, the reviewed evidence suggests that these technologies should currently be interpreted as promising but still evolving extensions, whose maturity and large-scale validation remain heterogeneous across application domains. Full article

Virtual reality (VR)-based rehabilitation is an established modality for upper extremity motor recovery; however, existing systems frequently rely on fixed, random, or therapist-tuned target placement that disregards patient-specific motor capacity and population-level priors. This study proposes a cross-patient collaborative swarm intelligence framework that derives zone-based patient profiles from real VR trajectories and augments them with a similarity-weighted cohort prior distilled from clinically similar patients’ successful trajectory clouds and zone-transition graphs. A hybrid Ant Colony Optimization (ACO)–Particle Swarm Optimization (PSO) algorithm optimizes 12 targets per session across a 27-zone ($3\times 3\times 3$) workspace using a five-component fitness function encompassing reachability, zone balance, movement efficiency, heatmap-guided challenge coverage, and swarm-flow consistency. The framework was evaluated retrospectively on a single-center cohort of 36 post-stroke patients and 6373 sessions under a leakage-safe simulation protocol with 70/30 chronological splits; outcomes are model-based proxy success rates derived from each patient’s profile rather than directly observed task success. The hybrid strategy achieved a mean simulated success rate of 85.5% ± 5.5%, a 36.4% relative improvement over random placement (Wilcoxon $p<{10}^{-7}$, Cohen’s $d=4.91$); the leakage-safe split yielded 80.1% on the held-out segment versus 61.1% for random, with no statistically significant train–test gap ($p=0.470$). Ablation confirmed both PSO and ACO are individually necessary ($\mathsf{\Delta }\ge 2.7$ pp, $p<0.001$). Total session-start computation is 78 ms on standard CPU hardware. These findings constitute a proof-of-concept that collaborative personalized swarm optimization can substantially outperform heuristic target placement under in silico evaluation; clinical efficacy in terms of standardized motor outcome measures remains to be established in a prospective randomized controlled trial, and the findings should be replicated across centers, task modes, and a larger cohort before generalization. Full article

Feature selection is essential for improving classification performance in high-dimensional biomedical data, yet conventional metaheuristic algorithms often suffer from premature convergence and loss of population diversity. To address these issues, this paper proposes a Feature Grouping and Improved Hybrid Breeding Optimization framework (FGIHBO). First, the original feature space is hierarchically partitioned using the Maximum Relevance Minimum Redundancy criterion and Symmetric Uncertainty analysis to alleviate the curse of dimensionality. Then, a Multi-Strategy Synergistic Improved Hybrid Breeding Optimization (MSIHBO) algorithm is developed by incorporating Grey Wolf Optimizer (GWO) guidance and a Shannon entropy-adaptive simulated annealing mechanism to balance exploration and exploitation. Experimental results on the CEC2022 benchmark suite demonstrate that MSIHBO provides robust optimization performance across diverse problem categories. Furthermore, evaluations on eleven high-dimensional biomedical datasets show that FGIHBO achieves average classification accuracies ranging from 92.77% to 97.66%. Compared with representative algorithms, including Multi-strategy Improved Grey Wolf Optimizer (MIGWO), Hybrid Whale Optimization Algorithm based on Gathering strategy (HWOAG), Dynamic Crow Search Algorithm (DCSA), GWO, Hybrid Breeding Optimization (HBO), Hybrid Breeding Optimization based on Lévy flight and Elite Opposition-Based Learning strategy (LEHBO), and MSIHBO, the proposed framework improves average classification accuracy by 1.47–27.46%, with the largest gain observed on dataset D10 relative to HWOAG. These results confirm the effectiveness, robustness, and scalability of the proposed framework for high-dimensional biomedical feature selection. Full article

Cable routing is a pivotal design component for electrical systems and safety-critical engineering fields, such as nuclear propulsion systems, nuclear power plants and aircraft. Scientific and optimized routing schemes are essential for efficient and safe power and signal transmission and for mitigating system failure risks. Previous studies have adopted heuristic search and swarm intelligence optimization algorithms for cable path planning; however, these methods tend to converge to local optima under complex constraints and cannot theoretically guarantee global optimality, failing to address multi-constraint, high-dimensional optimization challenges of confined-space cable routing. This paper proposes a mathematical programming-based systematic optimization model: it first discretizes continuous three-dimensional space into a grid coordinate system and constructs a composite cost field integrating geometric distance and thermal interference, then formulates a multi-objective optimization model considering path length, thermal impact and routing feasibility, which is converted into a single-objective problem via normalized weighting coefficients and solved by exact mathematical programming techniques, yielding a best feasible solution together with a provable lower bound and an optimality gap. When the solver converges within the time limit, global optimality for the discretized model can be certified. Simulation results show the proposed method reduces overall path cost by an average of 31.8% compared with classical algorithms like the A* algorithm, Dijkstra’s algorithm, Rapidly-exploring Random Tree (RRT), Particle Swarm Optimization (PSO), and Genetic Algorithm (GA). Furthermore, it cuts decision variables by an average of 70% (up to 82% in complex scenarios) against the 0–1 Integer Linear Programming (ILP) model and the graph-theoretic Multi-Commodity Flow (MCF) model with multi-cost considerations. These results preliminarily validate the favorable solution quality, computational efficiency and engineering applicability of the proposed model for confined-space cable routing optimization. Full article

The greater cane rat algorithm (GCRA) represents an emerging swarm intelligence paradigm derived from the instinctual survival patterns exhibited by greater cane rats (GCRs), which simulates the typical male-dominated survival patterns of the GCR species, including rainy-season mating and reproduction behaviors, dry-season behavioral differentiation of solitary males and clustered females, and their nonlinear adaptive foraging characteristics. Nevertheless, the original GCRA suffers from inherent defects in complex and high-dimensional optimization scenarios, encompassing premature convergence phenomena, inadequate local exploitation proficiency, constrained convergence precision, and a proneness to stagnation at local optima, which severely restrict its practical engineering application. To address the aforementioned limitations, this work introduces an enhanced hybrid variant of the greater cane rat algorithm, amalgamated with Teaching-and-Learning-Based Optimization (TLBO) and designated as the TLGCRA, incorporating three pivotal targeted innovations. Specifically, the TLGCRA innovatively introduces the two-stage teacher–student interactive learning mechanism of TLBO on the basis of retaining the core evolutionary and behavioral characteristics of the original GCRA, which effectively compensates for the insufficient local disturbance capability of the original algorithm and enriches population diversity to avoid local optimum stagnation. Furthermore, an adaptive parameter tuning strategy is innovatively designed and embedded in the iterative optimization process, which dynamically balances the global exploration and local exploitation capabilities of the algorithm, fundamentally improving the low learning efficiency and weak mining performance of the GCRA. A suite of computational simulations is conducted across 23 canonical benchmark functions and six representative constrained engineering design optimization scenarios. The introduced TLGCRA is benchmarked against the canonical GCRA, LPSO, and ten cutting-edge metaheuristic approaches. Empirical outcomes substantiate that the TLGCRA attains marked performance advantages in terms of convergence velocity, solution precision, and algorithmic resilience. In particular, the optimized design effectively improves the optimal solution precision of the algorithm in complex multimodal function optimization, and the standard deviation of multiple independent runs in six engineering application cases is close to zero, verifying its excellent stability. Statistical verification employing the Friedman test and Wilcoxon signed-rank test additionally corroborates that the TLGCRA exhibits statistically robust and dependable optimization efficacy. In summary, the proposed innovative fusion strategies endow the TLGCRA with stronger environmental adaptability and comprehensive optimization performance, enabling it to realize faster convergence speed and higher computational accuracy, as well as outstanding stability and robustness, thus furnishing a viable resolution framework for intricate constrained engineering optimization challenges. Full article

Accurate prediction of student performance and identification of key influencing factors are essential for improving teaching quality and enabling data-driven educational decision-making. However, conventional metaheuristic optimization algorithms often suffer from premature convergence, insufficient population diversity, and an inadequate balance between exploration and exploitation when solving complex optimization problems. To address these limitations, this study proposes an Improved Educational Competition Optimizer (IECO), which integrates three complementary strategies: an elite exemplar-guided cooperative learning mechanism to preserve population diversity, a rank-adaptive stage-wise search control strategy to dynamically regulate search intensity, and an elite-mean opposition-based refinement strategy to strengthen global exploration capability and local exploitation performance. To evaluate the effectiveness of the proposed method, IECO is applied to optimize the hyperparameters of the K-nearest neighbors (KNN) classifier, leading to the construction of an IECO-KNN grade prediction model. Extensive experiments conducted on the CEC2017 and CEC2022 benchmark suites demonstrate that IECO achieves superior optimization accuracy, faster convergence speed, and stronger robustness compared with several classical and advanced metaheuristic algorithms. Statistical analyses based on the Wilcoxon rank-sum test and Friedman ranking test further confirm the significance and stability of the proposed algorithm. Furthermore, experiments on a real-world educational dataset show that the proposed IECO-KNN model consistently outperforms the other optimization-based KNN models in terms of accuracy, Cohen’s Kappa coefficient, macro-precision, and macro-recall. In particular, the proposed model achieves the highest classification performance and demonstrates more stable prediction capability across independent runs. Correlation analysis further reveals that learning interest, classroom interaction frequency, and extracurricular information acquisition are the most influential factors affecting students’ academic performance. Overall, the proposed IECO and IECO-KNN framework provide an effective and reliable solution for complex optimization and intelligent educational prediction tasks, offering both theoretical contributions to swarm intelligence optimization and practical value for intelligent teaching evaluation systems. Full article