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

Mariem Baazaoui (), Saïd Hanafi () and Hichem Kamoun ()
Additional contact information
Mariem Baazaoui: University of Sfax
Saïd Hanafi: University of Valenciennes and Hainaut-Cambrésis
Hichem Kamoun: University of Sfax

A chapter in Operational Research in Business and Economics, 2017, pp 225-234 from Springer

Abstract: 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.

Keywords: Multiple bin size bin packing problem; Upper bound; Mixed integer linear program (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:prbchp:978-3-319-33003-7_11

Ordering information: This item can be ordered from
http://www.springer.com/9783319330037

DOI: 10.1007/978-3-319-33003-7_11

Access Statistics for this chapter

More chapters in Springer Proceedings in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().