Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

On solving three-dimensional open-dimension rectangular packing problems

Texto completo
Autor(es):
Junqueira, Leonardo ; Morabito, Reinaldo
Número total de Autores: 2
Tipo de documento: Artigo Científico
Fonte: ENGINEERING OPTIMIZATION; v. 49, n. 5, p. 733-745, 2017.
Citações Web of Science: 5
Resumo

In this article, a recently proposed three-dimensional open-dimension rectangular packing problem is considered, in which the objective is to find a minimal volume rectangular container that packs a set of rectangular boxes. The literature has tackled small-sized instances of this problem by means of optimization solvers, position-free mixed-integer programming (MIP) formulations and piecewise linearization approaches. In this study, the problem is alternatively addressed by means of grid-based position MIP formulations, whereas still considering optimization solvers and the same piecewise linearization techniques. A comparison of the computational performance of both models is then presented, when tested with benchmark problem instances and with new instances, and it is shown that the grid-based position MIP formulation can be competitive, depending on the characteristics of the instances. The grid-based position MIP formulation is also embedded with real-world practical constraints, such as cargo stability, and results are additionally presented. (AU)

Processo FAPESP: 14/16906-1 - Problemas de empacotamento, problemas de roteamento, e suas integrações
Beneficiário:Leonardo Junqueira
Modalidade de apoio: Auxílio à Pesquisa - Regular