| 裁剪与装填问题 |
| |
| 引用本文： | 孟冬梅.裁剪与装填问题[J].天津职业院校联合学报,2002,4(1):94-97. |
| |
| 作者姓名： | 孟冬梅 |
| |
| 作者单位： | 天津市和平区新华职工大学,天津,300040 |
| |
| 摘 要： | 裁剪与装填问题广泛存在于各行业的材料剪裁、平面布局设计及三维布局设计等方面。这些实际应用需要给出问题的最优解。然而，裁剪与装填问题是ＮＰ－完全问题，很难在有限的合理时间内取得最优解。这种广泛的实用性和解的复杂性使得这类问题成为国际上近年来的一个研究焦点、现简要介绍裁剪与装填问题的基本知识、基本分类以及裁剪问题与装填问题之间的内在联系，并重点介绍了此类问题的优化算法。
|
| 关 键 词： | 裁剪与装填问题 NP-完全问题 启发式方法 算法 |
| 文章编号： | 1009-2498(2002)01-0094-04 |
| 修稿时间： | 2001年8月8日 |
Cutting and Packing Problems |
| |
| MENG Dong-mei.Cutting and Packing Problems[J].Journal of Tianjin Vocational Institutes,2002,4(1):94-97. |
| |
| Authors: | MENG Dong-mei |
| |
| Institution: | Tianjin Xinhua staff and Worker University Tianjin 300040 |
| |
| Abstract: | Cutting and Packing Problems are widely occurred in the area of stock-cutting, two-Di- mensional layout design and three-Dimensional layout design of many industries. These applications need optimal solutions of Cutting and Packing Problems. However, these kinds of problems are NP-Complete, and it is difficult to give optimal solution within a reasonable time limit. The complexity and practicability of the problems makes itself one of the focuses within the research fields. This article presents the basic knowledge and the basic classification of the Cutting and Packing Problems. Our emphasis here is on the optimization algorithms of the problems. |
| |
| Keywords: | Cutting and Packing Problems NP-Complete heuristic algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
