Three-Dimensional Multiple-Bin-Size Bin Packing: A Case Study with a New MILP-Based Upper Bound

  • Mariem Baazaoui*
  • , Saïd Hanafi
  • , Hichem Kamoun
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In our research, we are interested in a practical problem closely related to the three-dimensional multiple-bin-size bin packing problem. We deal with the real word application of cutting mousse blocks proposed by a Tunisian industrial company. First, we present the general context related to this optimization problem. Second, for solving this practical problem, we propose an upper bound based on a MILP formulation (mixed integer linear programming). Finally, computational and comparative results are presented to evaluate the performance of the proposed bound by testing a large instance from the same industrial company.

Original languageEnglish
Title of host publicationOperational Research in Business and Economics - 4th International Symposium and 26th National Conference on Operational Research, 2015
EditorsEvangelos Grigoroudis, Michael Doumpos
PublisherSpringer Science and Business Media B.V.
Pages225-234
Number of pages10
ISBN (Print)9783319330013
DOIs
StatePublished - 2017
Externally publishedYes
Event4th International Symposium and 26th National Conference on Operational Research, 2015 - Chania, Greece
Duration: 4 Jun 20156 Jun 2015

Publication series

NameSpringer Proceedings in Business and Economics
ISSN (Print)2198-7246
ISSN (Electronic)2198-7254

Conference

Conference4th International Symposium and 26th National Conference on Operational Research, 2015
Country/TerritoryGreece
CityChania
Period4/06/156/06/15

Keywords

  • Mixed integer linear program
  • Multiple bin size bin packing problem
  • Upper bound

Fingerprint

Dive into the research topics of 'Three-Dimensional Multiple-Bin-Size Bin Packing: A Case Study with a New MILP-Based Upper Bound'. Together they form a unique fingerprint.

Cite this