期刊
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
卷 23, 期 1-2, 页码 187-213出版社
WILEY
DOI: 10.1111/itor.12111
关键词
packing problems; loading problems; linear programming; air transport; weight distribution
资金
- Interuniversity Attraction Poles Programme
- Belgian Science Policy Office [P7/36]
The 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据