| 求解下料问题的ー种算法 |
| |
| 引用本文： | 周培德.求解下料问题的ー种算法[J].兵工学报,2005,26(5):670-674. |
| |
| 作者姓名： | 周培德 |
| |
| 作者单位： | 北京理工大学信息科学技术学院，北京100081 |
| |
| 摘 要： | 给出各种模块的定义，并证明了它们的某些性质。在此基础上设计求解下料问题的一种算法，该算法首先处理基本模块，然后分2种不同情况构造基本模块的布局。分析了算法的复杂性和普遍性。列举3个计算实例，其裁剪率较为满意。
|
| 关 键 词： | 计算机科学技术基础学科 下料问题 基本模块 模块的布局 算法 复杂性 |
| 文章编号： | 1000-1093（2005）05-0670-05 |
| 收稿时间： | 2004-11-18 |
| 修稿时间： | 2004-11-18 |
An Algorithm for Solving Laying-off Problem |
| |
| ZHOU Pei-de.An Algorithm for Solving Laying-off Problem[J].Acta Armamentarii,2005,26(5):670-674. |
| |
| Authors: | ZHOU Pei-de |
| |
| Affiliation: | School of Information and Science Technology, Beijing Institute of Technology, Beijing 100081, China |
| |
| Abstract: | Giving the definitions of all kinds of modules and proving some of their properties, an algorithm for solving the laying-off problem was designed in terms of these definitions and properties. The idea of the algorithm has two steps: handling the fundamental module first and then planning its layout in two different cases. The complexity and generality of the algorithm were analyzed. Three examples were given. The results show that the cutting efficiency is more satisfactory. |
| |
| Keywords: | basic subject of science and technology for computer laying-off problem foundational module lay- out of the module algorithm complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《兵工学报》浏览原始摘要信息 |
|
点击此处可从《兵工学报》下载全文 |
