Abstract
In view of the NP-hard characteristics of assembly sequence planning problem and the low efficiency of solving the relatively optimal assembly sequence, this paper adopts meta-heuristic algorithms to solve the rotor blades assembly sequence optimization problem, Taking solution accuracy, solution efficiency, and solution robustness as assessment criteria, the effectiveness of solving the rotor blades assembly sequence with several meta-heuristic algorithms is compared and analyzed, the comparison results show that the simulated annealing algorithm has the best solution accuracy, efficiency and robustness for the assembly sequence optimization problem of rotor blades. In order to solve some problems during the solving process of simulated annealing, one improvement is added into it, by adding the reheating process to the SA, the probability that the SA algorithm accepts inferior solutions is increased, and the ability of SA jumping out of the local optimal solution is increased, and the global search capability of the SA algorithm is further enhanced. Finally, the effectiveness of the improved simulated annealing algorithm is verified in this paper by the assembly of steam turbine rotor blades.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
