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

Célia Paquay, Sabine Limbourg, Michaël Schyns, José Fernando Oliveira

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)1581-1592
Number of pages12
JournalInternational Journal of Production Research
Volume56
Issue number4
DOIs
Publication statusPublished - 2018
Externally publishedYes

Keywords

  • packing
  • matheuristics
  • relax-and-fix
  • transportation constraints
  • Unit Load Device
  • ALGORITHM
  • SYSTEM

Cite this

Paquay, Célia ; Limbourg, Sabine ; Schyns, Michaël ; Oliveira, José Fernando. / MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints. In: International Journal of Production Research. 2018 ; Vol. 56, No. 4. pp. 1581-1592.
@article{8e29dcde6ddc4720ab6585184ecd9e93,
title = "MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints",
abstract = "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.",
keywords = "packing, matheuristics, relax-and-fix, transportation constraints, Unit Load Device, ALGORITHM, SYSTEM",
author = "C{\'e}lia Paquay and Sabine Limbourg and Micha{\"e}l Schyns and Oliveira, {Jos{\'e} Fernando}",
year = "2018",
doi = "10.1080/00207543.2017.1355577",
language = "English",
volume = "56",
pages = "1581--1592",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Routledge/Taylor & Francis Group",
number = "4",

}

MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints. / Paquay, Célia; Limbourg, Sabine; Schyns, Michaël; Oliveira, José Fernando.

In: International Journal of Production Research, Vol. 56, No. 4, 2018, p. 1581-1592.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

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

AU - Paquay, Célia

AU - Limbourg, Sabine

AU - Schyns, Michaël

AU - Oliveira, José Fernando

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

KW - packing

KW - matheuristics

KW - relax-and-fix

KW - transportation constraints

KW - Unit Load Device

KW - ALGORITHM

KW - SYSTEM

U2 - 10.1080/00207543.2017.1355577

DO - 10.1080/00207543.2017.1355577

M3 - Article

VL - 56

SP - 1581

EP - 1592

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 4

ER -