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:Blanking algorithm on circular parts with T-shaped layout considering remaining material
Authors: Chen Yan Zhang Wei Ning Xiaojun Hu Xiaochun 
Unit: Guangxi University Guangxi University of Finance and Economics 
KeyWords: circular part blanking  T-shape layout  remaining material  sequence value correction  multi-period blanking 
ClassificationCode:TP391
year,vol(issue):pagenumber:2021,46(8):38-43
Abstract:

 For the blanking problem of small batcher and multi-period blanking for circular parts, which often occurs in the motor industry, from the perspective of weighing the simplicity for blanking process and increasing the utilization rate of materials as much as possible, a blanking algorithm considering the generation and utilization of remaining material on T-shape layout was proposed, and the optimization goal was to minimize the total area of material used in the entire multi-period blanking process. Then, the algorithm first used the remaining material in the inventory to meet the part demand of blank, and then used the sequential value correction method to meet the remaining demand. Furthermore, in the sequence value correction method, according to the corresponding remaining material strategy, it was allowed to actively generate the standardized remaining material strip to meet the part demand of subsequent orders. The experimental results show that the algorithm can significantly reduce the material cost in the long-term production of company, and the computation time is also within the acceptable range.

Funds:
国家自然科学基金资助项目(71371058);广西自然科学基金资助项目(2020GXNSFAA159090)
AuthorIntro:
陈燕(1975-),女,博士,教授 E-mail:gxcy@foxmail.com 通信作者:胡小春(1974-),男,硕士,副教授 E-mail:huxch999@163.com
Reference:

[1]崔耀东. 计算机排样技术及其应用
[M]. 北京:机械工业出版社, 2004.

 

Cui Y D. Computer Layout Technology and Its Application
[M]. Beijing:China Machine Press,2004.

 


[2]Cui Y D. Generating optimal T-shape cutting patterns for circular blanks
[J]. Computers & Operations Research, 2005, 32(1): 143-152.

 


[3]陈菲, 刘勇, 刘睿,等. 基于3块方式的圆形片剪冲排样算法
[J]. 计算机工程, 2009, 35(14): 195-196, 220.

Chen F, Liu Y, Liu R, et al. Cutting and punching layout algorithm for circular blanks based on three blocks pattern
[J]. Computer Engineering, 2009, 35(14): 195-196, 220.

 


[4]高淑婷, 李碧青. 基于4块排样方式的电机用圆形片下料算法
[J]. 微特电机, 2017, 45(10):74-77.

 

Gao S T, Li B Q. A cutting algorithm based on four block layout for circular pieces of motor
[J]. Small & Special Electrical Machines, 2017, 45(10): 74-77.

 


[5]陈燕, 刘咏, 谢琪琦, 等. 基于梯形和平行四边形的圆片剪冲下料算法设计与实现
[J]. 图学学报, 2016, 37(5): 661-667.

 

Chen Y, Liu Y, Xie Q Q, et al. An algorithm for circle cutting stock problem based on trapezoid and parallelogram
[J]. Journal of Graphics, 2016, 37(5): 661-667.

 


[6]陈燕, 谢琪琦, 刘咏, 等. 圆形件下料顺序分组启发式算法的设计与实现
[J]. 图学学报, 2017, 38(1): 5-9.

 

Chen Y, Xie Q Q, Liu Y, et al. The cutting stock problem of circular items based on sequential grouping heuristic algorithm
[J]. Journal of Graphics, 2017, 38(1): 5-9.

 


[7]欧诚意, 龙凤英,肖海华,等. 基于橡皮筋势能下降策略的圆形件排样算法
[J]. 机械设计与制造,2017,(4):184-188.

 

Ou C Y, Long F Y, Xiao H H, et al. Nesting algorithm for circular blanks based on rubber band potential energy descending
[J]. Machinery Design & Manufacture, 2017,(4):184-188.

 


[8]Cui Y D, Huang B. A heuristic for constrained T-shape cutting patterns of circular items
[J]. Engineering Optimization, 2011, 43(8): 867-877.

 


[9]曾志阳, 陈燕, 王珂. 圆片下料并行遗传算法的设计与实现
[J]. 计算机应用, 2020, 40(2): 392-397.

 

Zeng Z Y, Chen Y, Wang K. Design and implementation of parallel genetic algorithm for cutting stock of circular parts
[J]. Journal of Computer Applications, 2020, 40(2): 392-397.

 


[10]陈燕. 考虑可用余料的下料问题解法研究
[D]. 广州: 华南理工大学, 2019.

 

Chen Y. Research on the Solution Methods of the Cutting Stock Problems with Usable Leftovers
[D]. Guangzhou: South China University of Technology, 2019.

 


[11]王婷婷, 崔耀东, 陈燕, 等. 考虑余料生成及利用的圆片下料算法
[J]. 锻压技术, 2019, 44(4): 40-47.

Wang T T, Cui Y D, Chen Y, et al. An algorithm of circular piece cutting stock considering generation and utilization of margin
[J]. Forging & Stamping Technology, 2019, 44(4): 40-47.

 


[12]Clautiaux F, Sadykov R, Vanderbeck F, et al. Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
[J]. EURO Journal on Computational Optimization, 2019, 7(3): 265-297.

 


[13]Belov G, Scheithauer G. Setup and open-stacks minimization in one-dimensional stock cutting
[J]. INFORMS Journal on Computing, 2007, 19(1): 27-35.

 
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