基于启发式算法和遗传算法的三维装箱问题混合算法研究

Research on Hybrid Algorithms for 3D Packing Problem Based on Heuristic Algorithm and Genetic Algorithm

摘要: 在三维装箱问题中，启发式算法和遗传算法都能够较好地解决问题。本文在可放置点生成的启发式算法和遗传算法的基础上，将二者结合生成了新的混合算法来研究三维装箱问题，并通过真实应用场景数据对新的混合算法进行测试，混合算法的装载率和原传统算法相比稳中有增，尤其是针对货物规格种类较多的情况下，混合算法的优势更为明显。

Abstract: In the three-dimensional packing problem, both heuristic algorithms and genetic algorithms can effectively solve the problem. Based on the heuristic algorithm for generating placeable points and the genetic algorithm, this paper integrated the two algorithms into a new hybrid algorithm for the three-dimensional packing problem. The new hybrid algorithm was tested by real data in the application, and its loading rate was stable and had increased compared to the original traditional algorithm. Especially for cases with multiple types of goods, the advantages of the hybrid algorithm were more obvious.