Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Dynamic Programming Algorithms for Generating Optimal Strip Layouts
Computational Optimization and Applications
3D airspace sectoring by evolutionary computation: real-world applications
Proceedings of the 8th annual conference on Genetic and evolutionary computation
| Hi-index | 0.01 |
T-shape cutting patterns are applied in the manufacturing of circular and sectorial blanks for stators and rotors of large electric generators. The author presents an algorithm to generate them. In the patterns more than one row of identical blanks can appear in a strip. A strip is in one of the two perpendicular directions, namely X- or Y-direction. The algorithm uses the knapsack algorithm and an implicit enumeration method to determine the optimal combination of blank rows in the strips, the strip numbers and directions in the pattern. The algorithm is applied to the real cutting stock data of a factory that makes large electric generators. The results indicate that the algorithm is efficient both in computation time and in material usage.