A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case

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

3 Scopus citations

Abstract

In our research, we are interested in the three-dimensional multiple-bin-size bin packing problem (MBSBPP). 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 our optimization problem. Second we formulate it as a mathematical problem without considering the guillotine constraint, and then we tested it on small instances taken from the industry. Thereafter, we propose and test a lower bound for large instances from the same industrial company. Finally, some computational results are presented.

Original languageEnglish
Title of host publicationProceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014
EditorsImed Kacem, Pierre Laroche, Zsuzsanna Roka
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages219-224
Number of pages6
ISBN (Electronic)9781479967735
DOIs
StatePublished - 23 Dec 2014
Externally publishedYes
Event2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014 - Metz, France
Duration: 3 Nov 20145 Nov 2014

Publication series

NameProceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014

Conference

Conference2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014
Country/TerritoryFrance
CityMetz
Period3/11/145/11/14

Keywords

  • Lower bound
  • MBSBPP
  • MILP

Fingerprint

Dive into the research topics of 'A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case'. Together they form a unique fingerprint.

Cite this