Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints
Publication

Publications

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

Title
MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints
Type
Article in International Scientific Journal
Year
2018
Authors
Célia Paquay
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Sabine Limbourg
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Michaël Schyns
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 56
Pages: 1581-1592
ISSN: 0020-7543
Publisher: Taylor & Francis
Other information
Authenticus ID: P-00N-7P9
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.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 12
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Production scheduling in the context of Industry 4.0: review and trends (2020)
Another Publication in an International Scientific Journal
Parente, M; figueira, g; Pedro Amorim; Marques, A
Lot sizing and scheduling: industrial extensions and research opportunities (2011)
Another Publication in an International Scientific Journal
clark, a; almada-lobo, b; almeder, c
The integrated lot-sizing and cutting stock problem under demand uncertainty (2023)
Article in International Scientific Journal
Curcio, E; de Lima, VL; Miyazawa, FK; Silva, E; Pedro Amorim
Tackling perishability in multi-level process industries (2019)
Article in International Scientific Journal
Wenchao Wei; Pedro Amorim; Luís Guimarães; Bernardo Almada Lobo
Synchronisation of scarce resources for a parallel machine lotsizing problem (2011)
Article in International Scientific Journal
almeder, c; almada-lobo, b

See all (38)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-25 at 05:00:57 | Privacy Policy | Personal Data Protection Policy | Whistleblowing