| 三维矩形块布局的序列三元组编码方法 |
| |
| 引用本文： | 陆一平,查建中.三维矩形块布局的序列三元组编码方法[J].软件学报,2002,13(11):2183-2187. |
| |
| 作者姓名： | 陆一平 查建中 |
| |
| 作者单位： | 北方交通大学,机械与电子控制工程学院,北京,100044 |
| |
| 基金项目： | 国家自然科学基金资助项目(69974002);北方交通大学论文基金资助项目(PD119) |
| |
| 摘 要： | 解空间的序列对编码方法是解二维矩形体聚块布局问题的完整且有限(P-admissible)的编码方法.它产生于直观的分划过程(gridding procedure).受二维序列对编码方法的启示,对三维矩形聚块布局问题,也应该存在序列三元组编码方法.然而将直观分划过程直接推广到三维空间是困难的.通过对序列和部分序列的运算和分析,得到了三维矩形块聚块布局的序列三元组编码方法,此编码方法是完整且有限的.
|
| 关 键 词： | 布局 序列 编码 模拟退火 |
| 文章编号： | 1000-9825/2002/13(11)2183-05 |
| 收稿时间： | 2001/3/16 0:00:00 |
| 修稿时间： | 2001年3月16日 |
Sequence Triplet Method for 3D Rectangle Packing Problem |
| |
| LU Yi-ping and ZHA Jian-zhong.Sequence Triplet Method for 3D Rectangle Packing Problem[J].Journal of Software,2002,13(11):2183-2187. |
| |
| Authors: | LU Yi-ping and ZHA Jian-zhong |
| |
| Abstract: | The sequence-pair method is a sufficient and finite (P-admissible) coding method for solution space representation of 2D rectangle packing problem, and is proved from a graphical demonstration called Gridding Procedure. Inspired by the 2D sequence-pair method, there should also be sequence-triplet method for 3D rectangle packing problem. But in 3D space, the gridding procedure is difficult to be realized. In this paper, a way is introduced to achieve the sequence-triplet method for 3D rectangle packing problem by analysis and deduction of matrix representation of sequence and partial sequence. This sequence-triplet coding method is P-admissible. |
| |
| Keywords: | packing sequence coding simulated annealing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
