摘要
提出了利用近似算法求解二维矩形装箱问题的最小高度的一种方法。该方法基于启发式递归策略和遗传算法。利用启发式递归策略把所有大小各异的矩形都装入宽度固定的矩形容器中,并计算装完后所需容器的高度,用遗传算法的进化能力优化高度,使得所需容器的高度尽可能小。计算数据证明这种方法能够得到很好的结果,特别是对数据量大的测试问题,效果更好。
An evolutionary approximation algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This method is mainly based on heuristic strategies and genetic algorithm. The heuristic strategies are used to calculate the height of the packing order, and then the evolutionary capability of genetic algorithm to reduce the height is used. The computational results on well-known benchmark problems show that the presented approximation algorithm can compete with other algorithms based on genetic algorithm. Especially for large test problems, it performs better.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第9期189-190,193,共3页
Computer Engineering
基金
厦门大学院士启动基金资助项目(XX01109)
关键词
装箱问题
启发式
递归
遗传算法
Packing problems
Heuristic
Recursive
Genetic algorithm
