摘要
为求解正交矩形Packing问题提出了一个新颖而有效的砌墙式启发式算法.该算法主要基于砌墙式启发式策略,其思想主要来源于砖匠在砌墙过程中所积累的经验:基于基准砖的砌墙规则.对国际上公认的大量的Bench-mark问题例的计算结果表明,该算法的计算速度不仅比著名的现代启发式算法快,而且获得更优的高度.
A novel and effective bricklaying heuristic algorithm for two-dimensional rectangular Packing problem is presented. This algorithm is mainly based on bricklaying heuristic strategies inspired by a large number of experiences accumulated by bricklayers during the process of building the wall, especially, the building wall strategy based on the reference brick is presented. The computational results on large number of Benchmark problems have shown that this algorithm not only runs in shorter time than known meta-heuristic but also finds shorter height.
出处
《计算机学报》
EI
CSCD
北大核心
2008年第3期509-515,共7页
Chinese Journal of Computers
基金
国家自然科学基金(60773126)
福建省自然科学基金(A0710023)
厦门大学院士启动基金(X01109)
厦门大学“九八五”信息科技基金(0000-X07204)资助
