| 摘要: |
| 已研究多年的底盘装载问题属于ＮＰ完备问题，关于它的解决方法多为启发式方法．本文讨论了约束底盘装载问题，并提出了一种基于计算机的启发式方法．实例表明，该方法能较好地解决约束底盘装载问题． |
| 关键词: 约束 底盘装载 NP完备问题 启发式方法 构造法 改进法 |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家自然科学基金资助. |
|
| A HEURISTIC METHOD FOR CONSTRAINED PALLET LOADING PROBLEM |
|
Wang Jinmin,Chen Dongxiang,Zha Jianzhong,Wang Aihu,Zhang Jiexiao
|
| Abstract: |
| The pallet loading problem, which is NP-complete, has been studied for many years and solution methods tend to be heuristic. This paper discusses the constrained pallet loading problem and presents a computer-based heuristic method to solve it. The good results can be obtained by the method. |
| Key words: Constraint pallet loading problem NP-complete heuristic method construction improvement. |
