MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints

• Tipo: Artigo em Revista Científica Internacional
• Data: 2018

Autores

Célia Paquay (Autor) Outra; Sabine Limbourg (Autor) Outra; Michaël Schyns (Autor) Outra; José Fernando Oliveira (Autor) FEUP

Revista

Título: International Journal of Production Research

Vol. 56

Páginas: 1581-1592

ISSN: 0020-7543

Editora: Taylor & Francis

Indexação

ISI Web of Knowledge - 7 Citações

Scopus - 11 Citações

INSPEC

Outras Informações

ID Authenticus: P-00N-7P9

DOI: 10.1080/00207543.2017.1355577

Abstract (EN): This article is about seeking a good feasible solution in a reasonable amount of computation time to the three-dimensional Multiple Bin Size Bin Packing Problem (MBSBPP). The MBSBPP studied considers additional constraints encountered in real world air transportation situations, such as cargo stability and the particular shape of containers. This MBSBPP has already been formulated as a Mixed Integer linear Programming problem, but as yet only poor results have been achieved for even fairly small problem sizes. The goal of the work this paper describes is to develop heuristics that are able to quickly provide good initial feasible solutions for the MBSBPP. Three methodologies are considered, which are based on the decomposition of the original problem into easier subproblems: the matheuristics Relax-and-Fix, Insert-and-Fix and Fractional Relax-and-Fix. They have been parametrised on real data sets and then compared to each other. In particular, two of these techniques show promising results in reasonable computational times.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 12