rod cutting, bin packing problem, multiple subset sum problem Abstract: For cutting linear elements like steel rod or marble shelf from standard lengths, optimization for best utilization of raw material is frequently required to min- imize waste and reduce the production costs with packing smaller elements to standard lengths. As the input material can be order dependent, store handling is limited only to good remnants from previous cuttings or over-stocking. To handle production of this type rationally, solution consist of several types of optimizations. Putting theory to work in real production demands several aspects of application to be considered to fit the needs of designers and orders staff.
[1]
Emanuel Falkenauer,et al.
A hybrid grouping genetic algorithm for bin packing
,
1996,
J. Heuristics.
[2]
Paolo Toth,et al.
New trends in exact algorithms for the 0-1 knapsack problem
,
2000,
Eur. J. Oper. Res..
[3]
Hans Kellerer,et al.
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities
,
2000,
Inf. Process. Lett..
[4]
Emanuel Falkenauer,et al.
Genetic Algorithms and Grouping Problems
,
1998
.
[5]
S. Martello,et al.
Algorithms for Knapsack Problems
,
1987
.
[6]
Hans Kellerer,et al.
The Multiple Subset Sum Problem
,
2000,
SIAM J. Optim..