矩形件排样问题的遗传算法求解

ON GENETIC ALGORITHM FOR THE ORTHOGONAL PACKING OF RECTANGLES

本文研究了求解矩形件正交排样优化问题的遗传算法。同时，将矩形件正交排样问题转化为一个排列问题，提出了求一个排列所对应的排样图的下台阶算法（改进的ＢＬ算法）将下台阶算法与遗传算法相结合，用于矩形件排样问题的求解，给出了该算法的实现。用该算法对文献中的两个算例进行了求解，结果表明该算法获得了比ＢＬ算法更好的解，是一种较为行之有效的方法。

This paper studies the genetic algorithm for the orthogonal packing of rectangles. A 'downstairs' algorithm for decoding permutation of rectangles to packing pattern (improved BL algorithm) is presented. The implementation of genetic algorithm for the orthogonal packing of rectangles is discussed.By comparing, the solutions of two numerical examples show the effectiveness of this algorithm.