基于混合演化算法的二维下料问题

2-D Cutting-stock Problem Based on Hybrid Evolutionary Algorithm

介绍了将二维下料问题建模成旅行商问题的方法 ,指出单纯旅行商问题模型的局限性 ,认为其是一种启发式方法 ,理论上找不到全局最优解 .针对于此 ,在原有模型的基础上引入旋转变换 ,提出了两种混合演化算法捆绑式深化算法和元算法 .实例仿真表明 ,该算法可以获得比普通演化算法好的结果。

The method of modeling the 2-D Cutting-stock Problem to Traveling Salesman Problem (TSP) is introduced in this paper. Because of the limitation of the pure TSP model, it is considered as a heuristic method and it cannot find the global optimal solution in theory. According to this, the rotation transformation is introduced into the original model, and two kinds of hybrid Evolutionary Algorithm, i.e. Binding Evolutionary Algorithm and Memetic Algorithm, is proposed. The simulation study shows that they can get better result than normal Evolutionary Algorithm.