A Heuristic for the 3-staged 2D Cutting Stock Problem with Usable Leftover
Authors
Q.L. Chen, Y. Chen, Y.D. Cui, X.Y. Lu, L.P. Li
Corresponding Author
Q.L. Chen
Available Online July 2015.
- DOI
- 10.2991/eame-15.2015.208How to use a DOI?
- Keywords
- 3-staged cutting; beam search; recursive technique; usable leftover
- Abstract
A heuristic approach is proposed for the 3-staged two-dimensional cutting stock problem with usable leftover, where the unused rectangular segments can be returned to stock for future use. The approach is based on the recursive technique combined with beam search. A forward recursion is used to generate normal segments that consist of homogenous strips, and a beam search heuristic is used to obtain the 3-staged cutting patterns considering usable leftover. The computational results show that the algorithm is effective in reducing material cost.
- Copyright
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Q.L. Chen AU - Y. Chen AU - Y.D. Cui AU - X.Y. Lu AU - L.P. Li PY - 2015/07 DA - 2015/07 TI - A Heuristic for the 3-staged 2D Cutting Stock Problem with Usable Leftover BT - Proceedings of the 2015 International Conference on Electrical, Automation and Mechanical Engineering PB - Atlantis Press SP - 770 EP - 773 SN - 2352-5401 UR - https://doi.org/10.2991/eame-15.2015.208 DO - 10.2991/eame-15.2015.208 ID - Chen2015/07 ER -