Un Algoritmo GRASP con dos Parámetros de Relajación para el problema 3D-BIN Packing con Restricciones de Estabilidad

Abstract

Given a set of rectangular boxes and an unlimited number of rectangular containers of dimensions bigger than the boxes, the Three-dimensional Sin Packing Problem (3D-BPP) consists of packing all the boxes in the containers such that this one uses the minor number of containers. This problem is NP­ hard and presents applications in the packing processes of the diverse sectors of the industry and service. The present work introduces a GRASP Construction algorithm that uses two relaxation parameters to salve the problem of 3D-BPP with restrictions of stability, this is the packing must be realized so that the set of stiff packages does not present movement. A sufficient condition is established of optimality and a procedure of improvement. The numerical results show superiority as for the solution with regard to the greedy algorithm BFD.