Heuristic and exact methods for the cutting sequencing problem |
| |
Authors: | Enrico Faggioli Carlo Alberto Bentivoglio |
| |
Affiliation: | Istituto di Informatica, University of Ancona, Via Brecce Bianche, 60131 Ancona, Italy |
| |
Abstract: | Cutting stock problems deal with the generation of a set of cutting patterns that minimizes waste. Sometimes it is also important to find the processing sequence of this set of patterns to minimize the maximum queue of partially cut orders. In such instances a cutting sequencing problem has to be solved. This paper presents a new mathematical model and a three-phase approach for the cutting sequencing problem. In the first phase, a greedy algorithm produces a good starting solution that is improved in the second phase by a tabu search, or a generalized local search procedure, while, in the last phase, the problem is optimally solved by an implicit enumeration procedure that uses the best solution previously found as an upper bound. Computing experience, based on 300 randomly generated problems, shows the good performance of the heuristic methods presented. |
| |
Keywords: | Cutting stock Heuristics Tabu search |
本文献已被 ScienceDirect 等数据库收录! |
|