Uma Heurística para o problema de empacotamento de bins tridimensionais

Abstract

The problem addressed in this paper is that of orthogonally packing a given set of box-shaped items into the minimum number of three-dimensional rectangular and equal bins. The problem is NP-hard in the strong sense and extremely difficult to be solved in the practice. We introduce a new heuristic for the problem based upon the way the items fit a given bin which is dictated by two lists: corner points and items yet to be packed. Extensive computational experiments are reported for instances with up to 90 items, and the results are compared with those obtained from the literature.