کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1705121 | 1012424 | 2012 | 16 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Fast heuristic for constrained homogenous T-shape cutting patterns Fast heuristic for constrained homogenous T-shape cutting patterns](/preview/png/1705121.png)
Homogenous T-shape (HTS) cutting patterns are welcomed when the two-phase process is used to produce rectangular pieces from the stock plate, where the plate is cut into homogenous strips at the first phase, and the strips are divided into pieces at the second phase. A heuristic is presented for generating constrained HTS patterns, where the objective is to maximize the pattern value that is equal to the total value of the included pieces, observing the upper bound constraint on the frequency of each piece type. The heuristic is based on dynamic programming and branch-and-bound techniques. It can yield solutions close to optimal with short computation time. By providing good initial solutions, the heuristic can greatly improve the time efficiency of an existing exact branch-and-bound algorithm.
Journal: Applied Mathematical Modelling - Volume 36, Issue 8, August 2012, Pages 3696–3711