基于自适应混合遗传算法的装箱问题探讨

Study on an adaptive hybrid genetic algorithm for Container Loading Problem

多约束条件下的三维集装箱问题是NP难题,它的求解极为困难.提出了一种自适应混合遗传算法,该算法采用直观的自然数编码机制、混合启发式规则的解码方法和改进的遗传算子.仿真结果表明,该算法在效率和精度上均优于基于空间分解的启发式搜索法等常用的进化类算法.

Since the three-dimensional Container Loading Problem is an NP-hard problem, it is difficult to obtain an optimal solution. It was presented an adaptive hybrid genetic algorithm which adopted of N-array coding, relevant decoding algorithm combining with heuristic rules, and new genetic operators. The simulation result indicated that the proposed algorithm performed better in efficiency and precision than common evolutionary algorithms such as heuristic algorithm based on Space Decomposition.