| 矩形毛坯排样中条带长度的约束处理 |
| |
| 引用本文： | 孙英,崔耀东,高永丽. 矩形毛坯排样中条带长度的约束处理[J]. 数字社区&智能家居, 2009, 0(15) |
| |
| 作者姓名： | 孙英 崔耀东 高永丽 |
| |
| 作者单位： | 云南楚雄师范学院计算机科学与技术系;广西师范大学计算机科学与技术系; |
| |
| 基金项目： | 云南省教育厅科学研究基金项目(07Y11137);;楚雄师范学院院级青年项目(YJ0532);;广西科学基金资助项目(桂科自0728100) |
| |
| 摘 要： | 该文的排样问题是根据剪冲工艺的要求抽象出来的。剪冲工艺是指分两步将板材分割成毛坯:第一步用平剪床将板材切成条带;第二步采用剪或冲的方式,将条带切成毛坯。所考虑的工艺约束包括最小条带长度约束和最大条带长度约束,排样方式中条带的长度,必须在最小和最大条带长度约束值之间。该文对基本的动态规划算法加以改造,使之能够处理最小和最大条带长度约束,并在C++环境下,开发出同尺寸矩形毛坯排样系统UR。利用这个软件,进行了大量的例题测试,得出对生产实践具有指导意义的结论。
|
| 关 键 词： | 排样 动态规划 条带约束 |
Strip Length Constraints of Rectangle Cutting Patterns |
| |
| SUN Ying,CUI Yao-dong,GAO Yong-li. Strip Length Constraints of Rectangle Cutting Patterns[J]. Digital Community & Smart Home, 2009, 0(15) |
| |
| Authors: | SUN Ying CUI Yao-dong GAO Yong-li |
| |
| Affiliation: | 1.Department of Computer Science;Chuxiong Normal University;Chuxiong 675000;China;2.Department of Computer Science;Guangxi Normal University;Guilin 541004;China |
| |
| Abstract: | The cutting stock problem discussed comes from the requirement of the shearing and punching process,in which the plate is divided into finished items within two stages. A guillotine shear cuts the plate into strips at the first stage,and a punching press or a guillotine shear cuts the strips into items at the second stage. Constraints are put on the minimum and maximum strip lengths. This paper extends the dynamic programming algorithm,so that it can deal with the strip length constraints. Based on the algo... |
| |
| Keywords: | cutting stock dynamic programming strip length constraint |
| 本文献已被 CNKI 等数据库收录！ |
