Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm
作者：
Highlights：
• We address the constrained three-dimensional guillotine placement problem.
• We present ILP formulations for non-staged and 3-staged patterns.
• We present a binary tree-search algorithm for non-staged and 3-staged patterns.
• Optimal or near-optimal solutions are obtained in reasonable processing times.
• These approaches can be useful for different industrial cutting processes.
摘要
•We address the constrained three-dimensional guillotine placement problem.•We present ILP formulations for non-staged and 3-staged patterns.•We present a binary tree-search algorithm for non-staged and 3-staged patterns.•Optimal or near-optimal solutions are obtained in reasonable processing times.•These approaches can be useful for different industrial cutting processes.
论文关键词：Cutting and packing,Constrained three-dimensional cutting,Non-staged and 3-staged patterns,Mixed-integer linear programming models,Bottom-up packing
论文评审过程：Received 1 December 2019, Revised 3 November 2020, Accepted 5 November 2020, Available online 8 November 2020, Version of Record 24 January 2021.
论文官网地址：https://doi.org/10.1016/j.eswa.2020.114257
