How to Pack Trapezoids: Exact and Evolutionary Algorithms
本文提出一种精确多项式时间算法用于固定高度梯形的单箱装箱，并融合定制进化与局部搜索方法解决多箱版本，分析了重组、多样性与遗传修复等策略。
The purposes of this paper are twofold. In the first, we describe an exact polynomial-time algorithm for the pair sequencing problem and show how this method can be used to pack fixed-height trapezoids into a single bin such that interitem wastage is minimized. We then go on to examine how this algorithm can be combined with bespoke evolutionary and local search methods for tackling the multiple-bin version of this problem—one that is closely related to 1-D bin packing. In the course of doing this, a number of ideas surrounding recombination, diversity, and genetic repair are also introduced and analyzed.