The Two Dimensional Bin Packing Problem with Side Constraints

Markus Seizinger ()
Additional contact information
Markus Seizinger: University of Augsburg

A chapter in Operations Research Proceedings 2017, 2018, pp 45-50 from Springer

Abstract: Abstract We propose a new variant of Bin Packing Problem, where rectangular items of different types need to be placed on a two-dimensional surface. This new problem type is denoted as two-dimensional Bin Packing with side constraints. Each bin may consist of different two-dimensional sides, and items of different types may not overlap on different sides of the same bin. By different parameter settings, our model may be reduced to either a two- or three-dimensional Bin Packing Problem. We propose practical applications of this problem in production and logistics. We further introduce lower bounds, and heuristics for upper bounds. We can demonstrate for a variety of instance classes proposed in literature that the GAP between those bounds is rather low. Additionally, we introduce a Column-Generation based algorithm that is able to further improve the lower bounds and comes up with good solutions. For a total of 400 instances, extended from previous literature, the final relative gap was just 6.8%.

Date: 2018
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:oprchp:978-3-319-89920-6_7

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

DOI: 10.1007/978-3-319-89920-6_7

Access Statistics for this chapter

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