arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2312.08103cs.LGcs.DS
收藏

面向多维装箱问题的机器学习:文献综述与实证评估

Machine Learning for the Multi-Dimensional Bin Packing Problem: Literature Review and Empirical Evaluation

Shanghai Jiao Tong University(上海交通大学);National University of Defense Technology(国防科技大学)

Wenjie Wu, Changjun Fan, Jincai Huang, Zhong Liu, Junchi Yan

AI总结:

本文对面向多维装箱问题的机器学习方法开展首次系统性综述,完成问题形式化、方法梳理、基准测试与挑战展望。

摘要:

装箱问题(Bin Packing Problem, BPP)是一类经典的组合优化(combinatorial optimization, CO)问题。由于其在物流、资源分配等日常生活场景中应用广泛,研究者一直在探寻高效的装箱算法。与此同时,以高效性著称的机器学习(machine learning, ML)领域也在持续发展。本文首先对BPP进行形式化定义,介绍其变体与实际约束,随后对面向多维BPP的机器学习方法展开全面综述。我们进一步收集了若干3D BPP的公开基准,并在Cutting Stock Dataset(下料数据集)上评估了部分在线方法的性能。最后,本文分享了对BPP领域现存挑战与未来方向的见解。据我们所知,这是首份针对BPP相关机器学习方法的系统性综述。

英文摘要:

The Bin Packing Problem (BPP) is a well-established combinatorial optimization (CO) problem. Since it has many applications in our daily life, e.g. logistics and resource allocation, people are seeking efficient bin packing algorithms. On the other hand, researchers have been making constant advances in machine learning (ML), which is famous for its efficiency. In this article, we first formulate BPP, introducing its variants and practical constraints. Then, a comprehensive survey on ML for multi-dimensional BPP is provided. We further collect some public benchmarks of 3D BPP, and evaluate some online methods on the Cutting Stock Dataset. Finally, we share our perspective on challenges and future directions in BPP. To the best of our knowledge, this is the first systematic review of ML-related methods for BPP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑