Yuxin Che , Ying Liu , Qiang Gao , Andrew Lim , Qian Hu
{"title":"The Single Polybag Loading Problem","authors":"Yuxin Che , Ying Liu , Qiang Gao , Andrew Lim , Qian Hu","doi":"10.1016/j.endm.2018.07.010","DOIUrl":null,"url":null,"abstract":"<div><p>In the logistics industry, not only cartons but also polybags are used to pack goods for delivery. We study a single polybag loading problem, which is faced by many e-retailers and courier companies. In the problem, a set of rotatable boxes and a two-dimensional rectangular polybag are given. Because the polybag is flexible, the three-dimensional space inside the polybag can be variable when the boxes are loaded. The problem is to choose a subset of the boxes and pack them orthogonally into the polybag so as to maximize the space utilization. We introduce a mixed integer programming formulation and propose a tree search heuristic for the problem. Methods are evaluated by computational experiments on randomly generated data.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.010","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301549","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0
Abstract
In the logistics industry, not only cartons but also polybags are used to pack goods for delivery. We study a single polybag loading problem, which is faced by many e-retailers and courier companies. In the problem, a set of rotatable boxes and a two-dimensional rectangular polybag are given. Because the polybag is flexible, the three-dimensional space inside the polybag can be variable when the boxes are loaded. The problem is to choose a subset of the boxes and pack them orthogonally into the polybag so as to maximize the space utilization. We introduce a mixed integer programming formulation and propose a tree search heuristic for the problem. Methods are evaluated by computational experiments on randomly generated data.
期刊介绍：
Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
