A CAM system for one-dimensional stock cutting

被引:6
作者
Cui, Yaodong [1 ]
机构
[1] Guangxi Univ, Sch Comp Elect & Informat, Nanning 530004, Peoples R China
基金
中国国家自然科学基金;
关键词
Cutting stock; One-dimensional cutting; Pattern reduction; Multi-objectives; Stock cutting software; Sequential heuristic procedure; SEQUENTIAL HEURISTIC-PROCEDURE; PACKING; NUMBER; TYPOLOGY;
D O I
10.1016/j.advengsoft.2011.12.004
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper considers the one-dimensional cutting stock problem in which m types of items are cut from stock bars of multiple sizes such that the bar cost is minimized. A solution to this problem is a cutting plan consisting of a set of cutting patterns with specified frequency. A CAM system based on a sequential heuristic procedure is developed for generating cutting plans. The algorithm takes the reduction of bar cost as the primary objective, and considers two secondary objectives - pattern reduction and shorter stocks reduction. The system provides a set of non-dominated cutting plans so that the most appropriate one can be selected according to the specified circumstance. Computational results indicate that the algorithm can generate solutions comparable to or better than those of previously published algorithms that consider pattern reduction. (C) 2011 Published by Elsevier Ltd.
引用
收藏
页码:7 / 16
页数:10
相关论文
共 23 条
[1]  
Cerqueira G.R. L., 2009, Journal of Computational Interdisciplinary Sciences, V1, P159
[2]   A heuristic for the one-dimensional cutting stock problem with pattern reduction [J].
Cui, Y. ;
Zhao, X. ;
Yang, Y. ;
Yu, P. .
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2008, 222 (06) :677-685
[3]   C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction [J].
Cui, Yaodong ;
Liu, Zhiyong .
OPTIMIZATION METHODS & SOFTWARE, 2011, 26 (01) :155-167
[4]   LP models for bin packing and cutting stock problems [J].
de Carvalho, JMV .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) :253-273
[5]   A successive elimination method for one-dimensional stock cutting problems in ship production [J].
Dikili, A. Cemil ;
Sarioez, Ebru ;
Pek, Nazan Akman .
OCEAN ENGINEERING, 2007, 34 (13) :1841-1849
[6]   A TYPOLOGY OF CUTTING AND PACKING PROBLEMS [J].
DYCKHOFF, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 44 (02) :145-159
[7]   Pattern reduction in one-dimensional cutting stock problems [J].
Foerster, H ;
Wäscher, G .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (07) :1657-1676
[8]   A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1961, 9 (06) :849-859
[9]   A combined approach to the solution to the general one-dimensional cutting stock problem [J].
Gradisar, M ;
Trkman, P .
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (07) :1793-1807
[10]   A hybrid approach for optimization of one-dimensional cutting [J].
Gradisar, M ;
Resinovic, G ;
Kljajic, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 119 (03) :719-728