Home
Editorial Committee
Brief Instruction
Back Issues
Instruction to Authors
Submission on line
Contact Us
Chinese

  The journal resolutely  resists all academic misconduct, once found, the paper will be withdrawn immediately.

Title:An algorithm for solving problem of multiple plate single rectangle cutting stock
Authors: Pan Weiping  Chen Qiulian  Cui Yaodong  Li Hua 
Unit: Guangxi University 
KeyWords: nesting  single rectangle part  multiple plate cutting  dynamic programming  integer programming 
ClassificationCode:TP391
year,vol(issue):pagenumber:2014,39(11):6-10
Abstract:
 An optimal algorithm of generating multiple plate single rectangle part cutting process was put forward. Firstly, the dynamic programming method with the characteristic of full capacity was applied to generate all of the single plate patterns once. Then the integer programming model was established to solve the cutting process, and the number of each kind of plate used was obtained. The optimal goal was to minimize the total area of the plates used under the demand that blanks being satisfied. The experimental results show that,as for the plate number unconstrained problems and constrained problems, the material utilization rate with multiple plate algorithm is improved by 2.09% and 0.83% respectively more than that of single plate cutting algorithm cited in other articles. 
Funds:
国家自然科学基金资助项目(61363026,71371058);广西大学科研基金资助项目(XGL090030)
AuthorIntro:
潘卫平(1989-),男,硕士研究生 陈秋莲(1974-),女,博士,副教授
Reference:


[1]陈仕军, 曹炬. 一种 “一刀切” 式矩形件优化排样混合算法[J]. 锻压技术, 2009, 34(4): 143-147.Chen S J, Cao J. Hybird algorithm of guillotine rectangular cutting peoblem[J]. Forging & Stamping Technology, 2009, 34(4): 143-147.
[2]崔耀东, 张春玲, 赵谊. 同尺寸矩形毛坯排样的连分数分支定界算法[J]. 计算机辅助设计与图形学学报, 2004, 16(2): 252-256.Cui Y D, Zhang C L, Zhao Y.A continued fractions and branch-and-bound algorithm for generating cutting patterns with equal rectangles [J].Journal of Computer Aided Design & Computer Graphics, 2004, 16(2): 252-256.
[3]Cui Y D, Zhao Z G. Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns[J]. European Journal of Operational Research, 2013, 231(2): 288-298.
[4] Fabio F, Enrico M. Models for the two-dimensional two-stage cutting stock problem with multiple stock size[J]. Computers & Operations Research, 2013, 40:1953-1962.
[5] Ignacio H,Lorena P, Víctor P. Board cutting from logs: Optimal and heuristic approaches for the problem of packing rectangles in a circle[J].International Journal of Production Economics, 2013, 145(2): 541-546.
[6] Cui Y, Gu T, Hu W. Recursive algorithms for the optimum cutting of equal rectangles[J]. International Journal of Computers and Applications,2011, 33(2): 103-107.
[7] Cui Y. Dynamic programming algorithms for the optimal cutting of equal rectangles[J]. Applied Mathematical Modelling,2005, 29 (11): 1040-1053.

Service:
This site has not yet opened Download Service】【Add Favorite
Copyright Forging & Stamping Technology.All rights reserved
 Sponsored by: Beijing Research Institute of Mechanical and Electrical Technology; Society for Technology of Plasticity, CMES
Tel: +86-010-62920652 +86-010-82415085     Fax:+86-010-62920652
Address: No.18 Xueqing Road, Beijing 100083, P. R. China
 E-mail: fst@263.net    dyjsgg@163.com