Optimizing Assembly Error Reduction in Wind Turbine Gearboxes Using Parallel Assembly Sequence Planning and Hybrid Particle Swarm-Bacteria Foraging Optimization Algorithm
Sydney Mutale, Yong Wang, De Tian
Energies · 2025
doi:10.3390/en18153997 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
This study introduces a novel approach for minimizing assembly errors in wind turbine gearboxes using a hybrid optimization algorithm, Particle Swarm-Bacteria Foraging Optimization (PSBFO). By integrating error-driven task sequencing and real-time error feedback with the PSBFO algorithm, we developed a comprehensive framework tailored to the unique challenges of gearbox assembly. The PSBFO algorithm combines the global search capabilities of PSO with the local refinement of BFO, creating a unified framework that efficiently explores task sequencing, minimizing misalignment and torque misapplication assembly errors. The methodology results in a 38% reduction in total assembly errors, improving both process accuracy and efficiency. Specifically, the PSBFO algorithm reduced errors from an initial value of 50 to a final value of 5 across 20 iterations, with components such as the low-speed shaft and planetary gear system showing the most substantial reductions. The 50 to 5 error reduction represents a significant decrease in assembly errors from an unoptimized (50) to an optimized (5) sequence, achieved through the PSBFO algorithm, by minimizing dimensional deviations, torque mismatches, and alignment errors across 26 critical gearbox components. While the primary focus is on wind turbine gearbox applications, this approach has the potential for broader applicability in error-prone assembly processes in industries such as automotive and aerospace, warranting further validation in future studies.
Abstract licence: CC BY
References44
40 more references, whose wording the paper’s licence keeps private.
All 44 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.