节点文献

一种基于三段排样圆形毛坯下料算法

An algorithm for circle cutting stock problem based on three stages

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 陈燕刘咏胡小春崔耀东

【Author】 CHEN Yan;LIU Yong;HU Xiao-chun;CUI Yao-dong;School of Business Administration,South China University of Technology;School of Computer,Electronics and Information,Guangxi University;China Mobile Guangxi Co.,Ltd.;School of Information and Statistics,Guangxi University of Finance and Economics;Guangxi Colleges and Universities Key Laboratory of Parallel and Distributed Computing Technology;

【机构】 华南理工大学工商管理学院广西大学计算机与电子信息学院中国移动通信集团广西有限公司广西财经学院信息与统计学院广西高校并行与分布式计算技术重点实验室

【摘要】 为研究板材上的圆形毛坯下料问题,将矩形板材分成两个不对称的直角梯形段和一个平行四边形段,在三个段中分别采用递推算法确定条带的最优组合,从而得到一种排样方式;并利用线性规划模型求解解决圆形毛坯下料的整个方案。实验结果表明:不对称的梯形分割比对称的梯形分割获得更高的材料利用率;采用递推算法比动态规划求解的背包问题算法确定的排样方式少。

【Abstract】 To study the cutting problem of the circular blanks on the plate,at first,the rectangular plate is divided into two asymmetrical right-angle trapezoidal sections and one parallelogram section.Then the recursive algorithm is used to determine the optimal combination of the strips in three sections to obtain a sorting method. Finally,the linear programming model is used to get the solution of blanking circular blanks. Experimental results show that the asymmetric trapezoidal segmentation achieves higher material utilization ratio than the symmetrical trapezoidal segmentation,and the recursive algorithm has fewer nesting patterns than the dynamic programming algorithm.

【基金】 国家自然科学基金资助项目(61363026;51407037)
  • 【文献出处】 广西大学学报(自然科学版) ,Journal of Guangxi University(Natural Science Edition) , 编辑部邮箱 ,2017年06期
  • 【分类号】TP301.6
  • 【被引频次】1
  • 【下载频次】96
节点文献中: 

本文链接的文献网络图示:

本文的引文网络