| 三维布局的一种优化算法 |
| |
| 引用本文： | 王金敏,张平.三维布局的一种优化算法[J].天津大学学报(自然科学与工程技术版),1997,30(2):193-198. |
| |
| 作者姓名： | 王金敏 张平 |
| |
| 基金项目： | 国家教委高等学校博士学科点专项科研基金 |
| |
| 摘 要： | 分析了布局问题的特性，综合利用“爬山”策略思想和实体的八叉树操作语言，提出一种适合于三维实体布局的优化算法。实例表明，该算法能从任一初始布局方案快速收敛到一个局部最优的布局。此外，对实体八叉树旋转的操作语言进行了研究并给出相应的算法。
|
| 关 键 词： | 布局问题 爬山法 优化算法 NP完全问题 |
AN ANALYTICAL ALGORITHM FOR 3D PACKING PROBLEMS |
| |
| Wang Jinmin,Zhang Ping,Wang Aihu,Dong Ming,Cha Jianzhong.AN ANALYTICAL ALGORITHM FOR 3D PACKING PROBLEMS[J].Journal of Tianjin University(Science and Technology),1997,30(2):193-198. |
| |
| Authors: | Wang Jinmin Zhang Ping Wang Aihu Dong Ming Cha Jianzhong |
| |
| Institution: | Dept. of Mechanical Eng. |
| |
| Abstract: | According to the analysis of packing problems and with the help of operating language for object octree, this paper presents an anlytical algorithm for 3D packing problems. The algorithm uses the idea of hill climbing and can be convergeto a local optimal packing solution from an initial one quickly. The algorithm has been successfully applied to a 3D packing problem. Besides, the operating language for object octree rotation is studied and a related algorithm is set up. |
| |
| Keywords: | packing problems hill climbing octree NP complete |
| 本文献已被 CNKI 维普 等数据库收录！ |
