Name
Abstract | ||
|---|---|---|
A rectangular two-dimensional cutting stock problem in the steel bridge construction is discussed. It is the problem of cutting a set of rectangular items from plates with arbitrary sizes that lie in the supplier specified ranges, such that the necessary plate area is minimized. Several types of cutting patterns are used to compose the cutting plan. All of them are easy to generate and cut except the last one. The algorithm uses both recursive and dynamic programming techniques to generate patterns of the last type. The computational results of 22 practical instances indicate that the algorithm can produce solutions close to optimal, and the computation time is reasonable for practical use. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.cor.2007.10.019 | Computers & OR |
Keywords | DocType | Volume |
last type,practical use,dynamic programming technique,rectangular two-dimensional cutting stock,computational result,necessary plate area,rectangular item,computation time,stock problem,steel bridge construction,arbitrary size,heuristic algorithm,practical instance | Journal | 36 |
Issue | ISSN | Citations |
2 | Computers and Operations Research | 6 |
PageRank | References | Authors |
0.54 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yaodong Cui | 1 | 189 | 18.81 |
| Yiping Lu | 2 | 17 | 2.33 |