Heuristic algorithms for a turbine-blade-balancing problem

Heuristic algorithms for a turbine-blade-balancing problem

0.00 Avg rating0 Votes
Article ID: iaor20043673
Country: United Kingdom
Volume: 31
Issue: 8
Start Page Number: 1245
End Page Number: 1258
Publication Date: Jul 2004
Journal: Computers and Operations Research
Authors: ,
Keywords: engineering, heuristics
Abstract:

In the turbine-blade manufacturing industry, turbine-blades are machined and then are assembled to form a cylindrical roll of blades. The roll of blades should be balanced as much as possible, since otherwise the efficiency of the turbine generator might degrade. The turbine-blade balancing problem is known to be NP-hard, thus finding an optimal solution is likely to be computationally intractable for large problems. Several heuristic methods for turbine-blade balancing appeared in the literature. We propose heuristic methods for balancing blades based on the number partitioning algorithm. The proposed methods outperformed existing methods remarkably in terms of the accuracy with a negligible increase in the running time.

Reviews

Required fields are marked *. Your email address will not be published.