Ponente
Descripción
The three-dimensional multi-container packing problem (3DMCPP) is used to determine the non-overlapping packing of a set of finite three-dimensional rectangular elements into the minimum number of identical containers. We have taken as a starting point the transformation of the 3DMCPP problem as several problems of three-dimensional packaging of a single container (SCLP for its acronym in English) where it is sought to occupy the largest possible cargo space in each one, in a sequential manner. A Hybrid Heuristic Algorithm (HHA) using the wall-building strategy is presented. The mathematical model is implemented in a computer program that we have named DiContainer. The result of the HHA was applied in the truck loading process of the Empresa Comercializadora de Productos Agropecuarios Frutas Selectas, in its territorial base in Havana, with good results in the case of maximizing the occupied space and an adequate balance of the load. The results show that the proposed HHA produces solutions, in a reasonable amount of time, in which relatively few containers are needed. A case study for cargo loading was implemented at the Empresa de Frutas Selectas, where it was possible to verify the feasibility of the solution offered by the mathematical model and its superiority with respect to the empirical alternative existing up to now in the company.
