Meta-heurísticas para o problema de empacotamento 2D e 3D

• Autor(a) principal: Moraes, Anderson Zudio de
• Data de Publicação: 2018
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Biblioteca Digital de Teses e Dissertações da UERJ
• Texto Completo: http://www.bdtd.uerj.br/handle/1/7727
• topic: Metaheuristics; Two-dimensional Bin Packing; Three-dimensional Bin Packing; Single bin-size; Meta-heurística; Empacotamento bidimensional; Empacotamento tridimensional; Contêiner de tamanho único; Algoritmos computacionais; Computação - Matemática; Embalagens; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO

The bin packing problem consists of orthogonally packing a set of boxes into the minimum number of bins without overlap. The two and three-dimensional bin packing problem generalizes the well known unidimensional bin packing problem, which was characterized as NP-Hard in the beginning of NP-C Theory. This dissertation studies the classic versions of two and three-dimensional case of bin packing with fixed and non-fixed orientated boxes. The bin packing problem has many industrial applications and relates to other complex problems like cutting, repartitioning and scheduling. This work proposes heuristics combined with metaheuristics to devise good quality solutions for large-scale instances. This work presents extensive computational tests with 820 standard literature instances. The computational results devised by the best algorithm proposed, called BRKGA-VCD, demonstrate that this method produces equivalent or better solution compared to state-of-art algorithms found in the literature, improving the overall best known solution quality for this set of instances