Abstract
AbstractThe present paper discusses the problem of optimizing the loading of boxes into containers. The goal is to minimize the unused volume. This type of problem belongs to the family of multiple bin size bin packing problems (MBSBPP). The approach includes an extensive set of constraints encountered in real‐world applications in the three‐dimensional case: the stability, the fragility of the items, the weight distribution, and the possibility to rotate the boxes. It also includes the specific situation in which containers are truncated parallelepipeds. This is typical in the field of air transportation. While most papers on cutting and packing problems describe ad hoc procedures, this paper proposes a mixed integer linear program. The validity of this model is tested on small instances.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Transactions in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
