Large-scale nesting of irregular patterns using compact neighborhood algorithm

Journal of Materials Processing Technology

Volumn 103, Issue 1, 2000, Pages 135-140

  Cheng, S K ^a   Rao, K P ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONSTRAINT THEORY; GENETIC ALGORITHMS; LARGE SCALE SYSTEMS; OPTIMIZATION;

COMPACT NEIGHBORHOOD ALGORITHM; CUTTING STOCK PROBLEM; LARGE SCALE NESTING; ORIENTATION CONSTRAINTS;

INVENTORY CONTROL;

EID: 0033734617     PISSN: 09240136     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0924-0136(00)00402-7     Document Type: Article

References (9)

1. M. Adamowicz, The optimum two-dimensional allocation of irregular, multiple-connected shapes with linear, logical and geometric constraints, Ph.D. Thesis, Department of Electrical Engineering, New York University, 1969.
2. S.K. Cheng, K.P. Rao, Automatic generation of clearance for flat patterns, in: Proceedings of the Seventh International Manufacturing Conference in China, Harbin, Vol. 2, 1995, pp. 191-197.
3. Cheng S.K., Rao K.P. Quick and precise clustering of arbitrarily shaped flat patterns based on stringy effect. Comput. Ind. Eng. 33:1997;485-488.
4. S.K. Cheng, K.P. Rao, An intelligent stock layout technique for irregular patterns with multiple orientation constraints, in: Proceedings of the Fourth International Conference on Manufacturing Technology in Hong Kong, Hong Kong, November-December 1997 (CD-ROM; Computer Integrated Manufacturing Section).
5. Dori D., Ben-Bassat M. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition. Comput. Vision Graphics Image Process. 24:1983;131-159.
6. Dori D., Ben-Bassat M. Efficient nesting of congruent convex figures. Image Process. Comput. Vision. 27:1984;228-235.
7. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting stock problem - Part 1. Oper. Res. 9:1961;724-746.
8. J.H. Holland, K.J. Holyoak, R.E. Nisbett, P.R. Thagard, Induction: Processes of Inference, Learning and Discovery, MIT Press, Cambridge, MA, 1986.
9. Nee A.Y.C. A heuristic algorithm for optimum layout of metal stamping blanks. Ann. CIRP. 33:1984;317-320.