AN IMPROVED VERSION OF WANG ALGORITHM FOR 2-DIMENSIONAL CUTTING PROBLEMS

被引：49

作者：

OLIVEIRA, JF ^{[1
]}

FERREIRA, JS ^{[1
]}

机构：

[1] UNIV PORTO, FAC ENGN, P-4099 OPORTO, PORTUGAL

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1990年 / 44卷 / 02期

关键词：

optimization; performance; Two-dimensional cutting;

D O I：

10.1016/0377-2217(90)90361-E

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper deals with the two-dimensional cutting problem in which the pieces involved in the cutting process are rectangles and the number of times a piece may appear in a cutting pattern is bounded. A modified algorithm, which is an improved version of Wang's algorithm, is presented. The computational performance of both algorithms is illustrated and compared by tests applied to a large number of randomly generated problems. The algorithms were implemented in a microcomputer. © 1990.

引用

页码：256 / 266

页数：11

共 8 条

[1] ALGORITHM FOR 2-DIMENSIONAL CUTTING PROBLEMS [J].