求解集装箱装载问题的拟人算法

A Quasi-human Algorithm for Solving the Container Packing Problem

本文对长方体Pacing问题（即集装箱装载问题），提出了一种拟人型的启发式算法。不同于求解该问题的传统方法，本文利用最大穴度优先原则，使长方体的排列尽可能紧凑，从而使容器中装入画可能多的长方体。实验表明即使用于强异构型的困难算例，该算法也具有高效的求解结果。

This paper presents a new quasi-human heuristic algorithm to solve the container packing problem. Different from traditional algorithms, it uses a principle of ＂largest cave degree prior＂ to pack the cuboids as closely as possible such that more cuboids can be packed into the container. Even dealing with the difficult strong heterogeneous benchmarks, experiments show this algorithm has high quality.