Discrete no-fit polygon, a simple structure for the 2-D irregular packing problem

Ruan Jian Xue Bao/Journal of Software

Volumn 20, Issue 6, 2009, Pages 1511-1520

  Zhang, De Fu ^a,b   Chen, Jing Chi ^a   Liu, Yong Kai ^a   Chen, Huo Wang ^b,c  

^a XIAMEN UNIVERSITY   (China)

^b Longtop Group Post doctoral Research Center   (China)

^c NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

Discrete no fit polygon; Infeasible interval; Irregular packing problem; No fit polygon

Indexed keywords

COMPUTATIONAL RESULTS; DISCRETE NO-FIT POLYGON; GEOMETRY COMPLEXITY; HEURISTIC STRATEGY; INFEASIBLE INTERVAL; IRREGULAR PACKING PROBLEM; MODEL-BASED; NO-FIT POLYGON; PACKING PROBLEMS; SIMPLE STRUCTURES;

PROBLEM SOLVING;

EID: 67649435464     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1001.2009.03331     Document Type: Article

References (16)

1. Cui YD, He DL, Song XX. Generating optimal two-section cutting patterns for rectangular blanks. Computers and Operations Research, 2006, 33(6): 1505-1520.
2. Huang WQ, Chen DB, Xu RC. A new heuristic algorithm for rectangle packing. Computers and Operations Research, 2007, 34(11): 3270-3280.
3. Zhang DF, Han SH, Ye WG. A bricklaying heuristic algorithm for the orthogonal rectangular packing problem. Chinese Journal of Computers, 2008, 31(3): 509-515 (in Chinese with English abstract).
4. Bennell JA, Oliveira JF. The geometry of nesting problems: A tutorial. European Journal of Operational Research, 2008, 184(2): 397-415.
5. Babu AR, Babu NR. A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms. Computer-Aided Design, 2001, 33: 879-891.
6. Bouganis A, Shanahan M. A vision-based intelligent system for packing 2-D irregular shapes. IEEE Trans. on Automation Science and Engineering, 2007, 4(3): 382-394.
7. Zhang YP, Zhang CL, Jiang SW. An effective approach for leather nesting. Journal of Software, 2005, 16(2): 316-323 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/16/316.htm
8. Heckmann R, Lengauer T. A simulated annealing approach to the nesting problem in the textile manufacturing industry. Annals of Operations Research, 1995, 57: 103-133.
9. Fischer AD, Dagli CH. Employing subgroup evolution for irregular-shape nesting. Journal of Intelligent Manufacturing, 2004, 15: 187-199.
10. Gomes AM, Oliveira JF. A 2-exchange heuristic for nesting problems. European Journal of Operational Research, 2002, 141(2): 359-370.
11. Gomes AM, Oliveira JF. Solving irregular strip packing problems by hybridising simulated annealing and linear programming. European Journal of Operational Research, 2006, 171(3): 811-829.
12. Liu HY, He YJ. Algorithm for 2-D irregular-shaped nesting problem based on the NFP algorithm and lowest-gravity-center princlple. Journal of Zhejiang University-Science A, 2006, 7(4): 570-576.
13. Bennell JA, Song X. A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Computers and Operations Research, 2008, 35: 267-281.
14. Egeblad J, Nielsen BK, Odgaard A. Fast neighborhood search for two- and three-dimensional nesting problems. European Journal of Operational Research, 2007, 183(3): 1249-1266.
15. Burke E, Hellier R, Kendall G, Whitwell G. A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Operations Research, 2006, 54(3): 587-601.
16. Burke E, Hellier R, Kendall G, Whitwell G. Complete and robust no-fit polygon generation for the irregular stock cutting problem. European Journal of Operational Research, 2007, 179(1): 27-49.