关键词: 二维排样优化, 不规则形状, 遗传算法, 模拟退火算法, 早熟现象

Abstract: To explore more efficient methods for two-dimensional(2D) packing optimization in engineering field, 2D engineering packing optimization method based on Genetic Simulated Annealing Algorithms (GSAA) was proposed. Firstly, a mathematical model was constructed with plate utilization as optimization objective, and a convex polygons envelope method based on certain envelope criterion was used to conduct approximate processing of irregular shapes. On this basis, GSAA to solve this model was designed. This algorithm integrated the rapid global search capability of genetic algorithm with the strong local search capability of simulated annealing algorithm, moreover, genetic algorithm was used as outer loop and the simulated annealing algorithm was used as inner loop. By using strong local search capability of simulated annealing algorithm, the premature convergence of genetic algorithm was improved to avoid local optimum of searching process. Specific example was given to verified the feasibility and effectiveness of this algorithm to solving 2D packing problem.

Key words: two-dimensional packing optimization, irregular shape, genetic algorithms, simulated annealing algorithms, premature phenomena