| 三维装箱问题的启发式算法 |
| |
| 引用本文： | 罗建军,吴东辉,罗细飞. 三维装箱问题的启发式算法[J]. 物流技术, 2012, 0(3): 127-128,140 |
| |
| 作者姓名： | 罗建军 吴东辉 罗细飞 |
| |
| 作者单位： | 武汉纺织大学管理学院 |
| |
| 摘 要： | 三维装箱问题是一类典型的NP-hard组合优化问题。在一维、二维装箱问题基础上,设计了一种启发式算法,借以克服一般启发式算法依赖"经验"的不足,该算法结构简单,实验表明算法收敛速度快。
|
| 关 键 词： | 三维装箱问题 启发式算法 优化组合 |
A Heuristic Algorithm for 3D Bin-packing Problem |
| |
| LUO Jian-jun,WU Dong-hui,LUO Xi-fei. A Heuristic Algorithm for 3D Bin-packing Problem[J]. Logistics Technology, 2012, 0(3): 127-128,140 |
| |
| Authors: | LUO Jian-jun WU Dong-hui LUO Xi-fei |
| |
| Affiliation: | (School of Management,Wuhan Textile University,Wuhan 430073,China) |
| |
| Abstract: | The 3D bin-packing problem is a classic NP-hard combinatorial optimization problem.On the basis of 1D and 2D bin-packing problems,this paper develops a heuristic algorithm to overcome the over-reliance on "experience" of the general heuristic algorithm.This algorithm is structurally simple and has high convergence speed as is demonstrated in an experimental study. |
| |
| Keywords: | 3D bin-packing problem heuristic algorithm combinatorial optimization |
| 本文献已被 CNKI 等数据库收录！ |
|
