.png){kind=icon}
返回
Algorithms for the variable-sized bin packing problem with time windows
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2021.107175.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces and studies the variable-sized bin packing problem with time windows, a real problem in the logistics industry. Given a set of items with different volume and time window, and several types of bins with variable size and cost, the objective is to select bins with the minimum cost to pack all the items. The total volume packed in the same bin must not exceed the volume capacity, and there must be one common time point among the time windows of the items in the same bin. We first formulate the problem as an integer programming model and then propose three heuristics to solve this problem. Firstly, the classical best-fit heuristic is modified to find an initial solution. An iterative local search based on the shortest path decoder is employed to find more solutions. Lastly, a primal heuristic based on the column generation is utilized. These three heuristics are different and independent. Two categories of instances are generated to test the performance of our approach. The results demonstrate that the proposed approach is effective in solving this problem and finds near-optimal solutions in a short time.
Keyword:
Packing
Time window
Primal heuristic
Iterative local search
Column generation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Bin packing and cutting stock problems: Mathematical models and exact algorithms装箱和切割库存问题: 数学模型和精确算法
.png){kind=icon}
PREAI
分享收藏
分享收藏
查看更多内容