单塑料袋装载问题

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI:10.1016/j.endm.2018.07.010

Yuxin Che , Ying Liu , Qiang Gao , Andrew Lim , Qian Hu

{"title":"单塑料袋装载问题","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":"{\"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}","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

摘要

在物流业中，不仅用纸箱包装货物，还用塑料袋包装货物。我们研究了一个单一的塑料袋装载问题，这是许多电子零售商和快递公司所面临的问题。在该问题中，给出了一组可旋转盒子和一个二维矩形塑料袋。由于塑料袋是柔性的，当箱子装载时，塑料袋内部的三维空间可以改变。问题是选择盒子的一个子集，并将它们正交地装入塑料袋中，以最大限度地利用空间。我们引入了一个混合整数规划公式，并提出了求解该问题的树搜索启发式算法。方法是通过随机生成数据的计算实验来评估的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The Single Polybag Loading Problem

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 Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： 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.