An integrated machine vision based system for solving the nonconvex cutting stock problem using genetic algorithms

被引:20
作者
Anand, S [1 ]
McCord, C [1 ]
Sharma, R [1 ]
Balachander, T [1 ]
机构
[1] Univ Cincinnati, Comp Aided Mfg Lab Ind Engn, Cincinnati, OH 45221 USA
关键词
genetic algorithm; optimization; nesting; cutting stock problem; irregular shapes; machine vision systems; bill of materials; leather cutting; NC cutting;
D O I
10.1016/S0278-6125(00)87642-6
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The two-dimensional stack cutting problem is well known and often studied. A genetic algorithm approach to the problem is developed that is capable of handling some of the more intractable forms of the problem: nonconvex parts; nonconvex sheets; multiple irregularly shaped sheets; and so on. An integrated system is developed that incorporates a machine vision module for acquiring the images of irregular (nonconvex) parts and sheets, polygonalizing them, and storing them in a database of parts and sheets. Using the polygonal images as well as the manufacturing schedules and priorities as input, a genetic algorithm is used to generate part layouts that satisfy the manufacturing constraints. The significant features of this approach are (1) the integration of all aspects of the layout process and (2) the flexibility of the genetic algorithm approach, which allows it to be adapted to fit the special requirements of different problems. The proposed methods can be particularly useful in the leather and apparel industries, where nonconvex parts and sheets are commonly used.
引用
收藏
页码:396 / 415
页数:20
相关论文
共 35 条
[1]  
Adamowicz M., 1976, Computer Aided Design, V8, P27, DOI 10.1016/0010-4485(76)90006-3
[2]   MINIMIZING TRIM LOSS IN CUTTING RECTANGULAR BLANKS OF A SINGLE SIZE FROM A RECTANGULAR SHEET USING ORTHOGONAL GUILLOTINE CUTS [J].
AGRAWAL, PK .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 64 (03) :410-422
[3]   OPTIMAL ALLOCATION OF TWO-DIMENSIONAL IRREGULAR SHAPES USING HEURISTIC-SEARCH METHODS [J].
ALBANO, A ;
SAPUPPO, G .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1980, 10 (05) :242-248
[4]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[5]  
[Anonymous], 1973, PATTERN RECOGNITION
[6]  
[Anonymous], 1991, Handbook of genetic algorithms
[7]  
BEAN JC, 1994, 945 U MICH DEP IND O
[8]  
BEASLEY JE, 1985, J OPER RES SOC, V36, P297
[9]   AN EXACT TWO-DIMENSIONAL NON-GUILLOTINE CUTTING TREE-SEARCH PROCEDURE [J].
BEASLEY, JE .
OPERATIONS RESEARCH, 1985, 33 (01) :49-64
[10]   ALGORITHM FOR 2-DIMENSIONAL CUTTING PROBLEMS [J].
CHRISTOFIDES, N ;
WHITLOCK, C .
OPERATIONS RESEARCH, 1977, 25 (01) :30-44