中文摘要：

采用遗传算法解决矩形件带排样问题，用带符号的有序整数串作为初始种群个体，改善了初始个体解的质量．提出基于最低水平线的择优插入算法，在解码过程中动态地调整个体中的零件顺序，选取最适合的零件进行填充，使零件排放紧凑，提高了材料的利用率．对20多道基准排样例题的实验计算结果表明，文中算法速度快，所得排样方案的材料利用率高．最后提出利用该算法解决VLSI模块布局问题的方法框架．

英文摘要：

A genetic algorithm is proposed for the rectangular strip packing problem. It uses the sorted integer string with symbol as individuals of the initial population, so that the quality of the related solutions can be improved. An approach adapted from the minimum horizon approach is used to decode the strings. It dynamically adjusts the orders of the elements in a string, and selects the most appropriate to pack at the current position, such that the material utilization may be improved. The computational results from more than twenty benchmark problems indicate that the algorithm is efficient both in computation time and in material utilization. Finally, a framework based on the algorithm is proposed for the VLSI module placement problem.