We consider a complex variant of the Container Loading Problem, arising from a real-world industrial application. It includes several features such as multiple containers, box rotation, bearable weight and multi-drop, which are of importance in many pratical situations. In addition, it also considers the situation in which boxes have to be delivered to different destinations (multi-drop).

Our solution technique is based on local search metaheuristics. Local search works on the space of sequences of boxes to be loaded, while the actual load is obtained by invoking, at each iteration, a specialized procedure called loader. The loader inserts the boxes in the container using a deterministic heuristic which produces a load that is feasible according to the constraints.

We test our solver on both real-world instances and on benchmarks from the literature. The outcome is that the results are in general comparable with the best ones in the literature.

In this website it is possibile to view and validate your solution file.