摘要
底盘装载问题在理论和实践上都有较高研究价值.本文将底盘对称地分为三个区,提出了一种快速有效的启发式算法:首先布置底盘四周的两个对称区,然后用同样的方法布置中间的空白区,直到空白区不能再放入一个矩形为止.实验结果证明了该算法的快速、有效性.
The pallet loading problem has higher researching value in theoretical and practical aspects.This paper divdes the pallet into 2 symmetrical blocks on the perimeter and leaves a hole in the center.We first pack the blocks with the same oriented rectangles respectively , then look the hole as a new pallet and recursively fill it until no more rectangles can be put in it . The experimental results indicate that the algorithm is flexibel and effectivc.
出处
《河北工业大学学报》
CAS
1998年第1期1-6,共6页
Journal of Hebei University of Technology
基金
国家自然科学基金
关键词
布局
组合优化
底盘装载问题
启发式算法
Packing , Pallet loading problem , Heuristics , Combinatorial optimization.