Um algoritmo de busca tabu para o carregamento de contêineres com caixas idênticas

this paper tackles the container loading problem, which consists of determining the most effective way of arranging items (for example, products packed in boxes) in larger objects (for example, containers). in particular, we consider the special case in which the boxes to be arranged are rectangular-shaped and identical. in order to solve this problem, we extend the tabu search algorithm by pureza and morabito, originally designed for the manufacturer's pallet loading problem. from a starting solution generated by a block heuristic, the algorithm performs moves, which change the orientation and/or expand selected blocks, resulting in new loading patterns. computational results obtained with 22 instances from the literature suggest that the proposed approach is promising.