The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon

被引:115
作者
Bennell, JA
Dowsland, KA
Dowsland, WB
机构
[1] Univ Wales Swansea, European Business Management Sch, OR Grp, Swansea SA2 8PP, W Glam, Wales
[2] Univ Southampton, Dept Management, Southampton SO9 5NH, Hants, England
关键词
irregular cutting stock problem; nesting; geometric algorithm;
D O I
10.1016/S0305-0548(00)00021-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The nofit polygon is a powerful and effective tool for handling the geometry required for a range of solution approaches to two-dimensional irregular cutting-stock problems. However, unless all the pieces are convex, it is widely perceived as being difficult to implement, and its use has therefore been somewhat limited, The primary purpose of this paper is to correct this misconception by introducing a new method of calculating the nofit polygon. Although it is based on previous approaches which use the mathematical concept of Minkowski sums, this new method can be stated as a set of simple rules that can be implemented without an indepth understanding of the underlying mathematics. The result is an approach that is both very general and easy to use. Scope and purpose Cutting and packing problems involving irregular shapes are common in industries ranging from clothing and footware to engineering and shipbuilding. An important feature of any automated solution technique for such problems is the way in which the geometric calculations are handled. One of the most efficient approaches is to pre-process many of the calculations using a concept known as the nofit polygon (NFP). However, use of the NFP has been limited due to the difficulty in its calculation for arbitrary irregular pieces, This paper outlines the concept of the NFP in the context of the irregular cutting-stock problem and introduces a new simplified approach to its calculation. The aim is to make this powerful concept more easily accessible to those involved in the cutting and packing of irregular shapes, (C) 2000 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:271 / 287
页数:17
相关论文
共 19 条
  • [1] Adamowicz M., 1976, Computer Aided Design, V8, P27, DOI 10.1016/0010-4485(76)90006-3
  • [2] ART RC, 1966, 36Y08 IBM CAMBR SCI
  • [3] Bennell J.A., 1998, THESIS U WALES SWANS
  • [4] A tabu thresholding implementation for the irregular stock cutting problem
    Bennell, JA
    Dowsland, KA
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1999, 37 (18) : 4259 - 4275
  • [5] CUNINGHAMEGREEN R, 1989, NEW SCI, P50
  • [6] SOLUTION APPROACHES TO IRREGULAR NESTING PROBLEMS
    DOWSLAND, KA
    DOWSLAND, WB
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 84 (03) : 506 - 521
  • [7] Jostling for position: local improvement for irregular cutting patterns
    Dowsland, KA
    Dowsland, WB
    Bennell, JA
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (06) : 647 - 658
  • [8] A UNIFIED COMPUTATIONAL FRAMEWORK FOR MINKOWSKI OPERATIONS
    GHOSH, PK
    [J]. COMPUTERS & GRAPHICS, 1993, 17 (04) : 357 - 378
  • [9] AN ALGEBRA OF POLYGONS THROUGH THE NOTION OF NEGATIVE SHAPES
    GHOSH, PK
    [J]. CVGIP-IMAGE UNDERSTANDING, 1991, 54 (01): : 119 - 144
  • [10] Grunbaum Branko., 1967, Graduate Texts in Mathematics, V221