关键词: 排样优化, 自适应遗传算法, 模拟退火, 最低水平线择优

Abstract: An adaptive genetic simulated annealing algorithm applied to the problem of packing optimization of rectangles is studied in this paper. The packing sequence of rectangles is coded by integer. The initial population is constructed by the combination of empirical selection and stochastic generation. And the adaptive crossover probability and mutation probability are adopted to control the convergent speed of genetic algorithm dynamically. A simulated annealing algorithm is used to lead the search scope developed in the direction of global optimal. It uses the heuristic optimization strategy of lowest horizontal line algorithm as decoding method of packing sequence and forms the cutting patterns. Multiple sets of experimental results show that the adaptive genetic simulated annealing algorithm with high solving speed can effectively increase the utilization of sheet.

Key words: packing optimization, adaptive genetic algorithm, simulated annealing, optimization strategy of lowest horizontal line