Article ID: | iaor20002830 |
Country: | Netherlands |
Volume: | 117 |
Issue: | 2 |
Start Page Number: | 368 |
End Page Number: | 381 |
Publication Date: | Sep 1999 |
Journal: | European Journal of Operational Research |
Authors: | Wagner Bret J. |
Keywords: | heuristics, programming: integer, programming: linear |
This paper discusses a one-dimensional cutting stock problem in which lumber is cut in bundles. The nature of this problem is such that the traditional approaches of linear programming with an integer round-up procedure or sequential heurisitcs are not effective. A good solution to this problem must consider trim loss, stock usage and ending inventory levels. A genetic search algorithm is proposed and results compared to optimal solutions for an integer programming formulation of the problem.