A Hybrid Heuristic Algorithm for the Rectangular Packing Problem

A Hybrid Heuristic Algorithm for the Rectangular Packing Problem
复制标题

DOI：
10.1007/11428831_97
复制
发表时间：
2005-05
期刊：
--
影响因子：
--
通讯作者：
Defu Zhang;Ansheng Deng;Yan Kang
Defu Zhang;Ansheng Deng;Yan Kang
中科院分区：
其他
文献类型：
--
作者：
Defu Zhang;Ansheng Deng;Yan Kang

文献摘要

被引文献

相似文献

提出了一种求解二维矩形布局问题的混合启发式算法。该算法主要基于分治策略和贪心策略。在一类基准问题上的计算结果表明，启发式算法的性能优于拟人启发式算法。
A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presented. This algorithm is mainly based on divide-and-conquer and greedy strategies. The computational results on a class of benchmark problems have shown that the performance of the heuristic algorithm can outperform that of quasi-human heuristics.