O PROBLEMA DA MOCHILA TRIDIMENSIONAL RESOLVIDO POR UMA HEURÍSTICA

Packing problems have been used in industries constantly, mainly in supply chain and logistic organizations. This research deals with the knapsack problem in its three-dimensional version with the objective of maximize the occupied volume for a single container. We study the version of the problem in which there is no limit on the number of copies of each item that may be packed, but items must be arranged with no overlapping and respecting the container dimensions. We present a heuristic based on the Simulated Annealing metaheuristic that aims for minimize the trim loss, and that selects items with the best fitness value, considering empty spaces. The C programming language was used to code the algorithms, in which computational experiments using instances from the literature shown that the heuristic is reasonable for solve medium-sized instances, whereas it fails in some cases.

[1]  Stephen C. H. Leung,et al.  A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem , 2012, Comput. Oper. Res..

[2]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[3]  Michael Eley,et al.  Solving container loading problems by block arrangement , 2002, Eur. J. Oper. Res..

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Reinaldo Morabito,et al.  Three-dimensional container loading models with cargo stability and load bearing constraints , 2012, Comput. Oper. Res..

[6]  Reinaldo Morabito,et al.  Modelos de otimização para problemas de carregamento de contêineres com considerações de estabilidade e de empilhamento , 2010 .

[7]  Hermann Gehring,et al.  A Genetic Algorithm for Solving the Container Loading Problem , 1997 .

[8]  Jens Egeblad,et al.  Heuristic approaches for the two- and three-dimensional knapsack packing problem , 2009, Comput. Oper. Res..

[9]  Andrew Lim,et al.  The single container loading problem with axle weight constraints , 2013 .

[10]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[11]  E. E. Bischoff,et al.  Issues in the development of approaches to container loading , 1995 .

[12]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[13]  John E. Beasley,et al.  Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .

[14]  Chin-Sheng Chen,et al.  An analytical model for the container loading problem , 1995 .

[15]  Guido Perboli,et al.  The three-dimensional knapsack problem with balancing constraints , 2012, Appl. Math. Comput..