摘要：AbstractThis paper addresses the so called ”Distributor’s Pallet Packing Problem” in a real industrial scenario. The main goal is to develop an algorithm for loading heterogeneous rectangular boxes on a bin, minimizing some objective functions and also satisfying geometric, stability and fragility constraints. The algorithm must be able to provide, in a reasonable time, the spatial coordinates of the vertices of the placed boxes and also the optimal boxes input sequence. Since this type of combinatorial problem is classified as NP-hard, classical optimization techniques are not suitable. For these reasons, a metaheuristic approach has been developed in order to reduce burden complexity. In particular, a genetic algorithm hybridized with an innovative heuristic technique has been used. The validity and the performance of this algorithm have been tested on several packing instances (orders) provided by an industrial company. The paper is intended as a preliminary study for future developments in the area of industrial container loading problems.
