A genetic algorithm solution for one-dimensional bundled stock cutting

A genetic algorithm solution for one-dimensional bundled stock cutting

0.00 Avg rating0 Votes
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:
Keywords: heuristics, programming: integer, programming: linear
Abstract:

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.

Reviews

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