The Minimum Size Instance of a Pallet Loading Problem Equivalence Class
Loading...
Authors
Martins, Gustavo H.A.
Dell, Robert F.
Subjects
Packing
Pallet Loading Problem
Pallet Loading Problem
Advisors
Date of Issue
2007
Date
2007
Publisher
Language
Abstract
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular
pallet. Boxes may be rotated 90so long as they are packed with edges parallel to the pallet’s edges, i.e., in an orthogonal
packing. This paper defines the Minimum Size Instance (MSI) of an equivalence class of PLP, and shows that every class has one and only one MSI. We develop bounds on the dimensions of box and pallet for the MSI of any class. Applying our new bounds on MSI dimensions, we present an algorithm for MSI generation and use it to enumerate all 3,080730 equivalence classes with an area ratio (pallet area divided by box area) smaller than 101 boxes. Previous work only provides bounds on the ratio of box dimensions and only considers a subset of all classes presented here.
Type
Article
Description
European Journal of Operational Research, 179, 2007, pp. 17-26.
The article of record as published may be found at http://dx.doi.org/10.1016/j.ejor.2006.03.009
The article of record as published may be found at http://dx.doi.org/10.1016/j.ejor.2006.03.009
Series/Report No
Department
Operations Research (OR)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Martins, G.H.A. and R.F. Dell, “The Minimum Size Instance of a Pallet Loading Problem Equivalence Class,” European Journal of Operational Research, 179, 2007, pp. 17-26.
Distribution Statement
Rights
defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.