The 3D bin packing problem for multiple boxes and irregular items based on deep Q-network-Reference-Cited by-同舟云学术

The 3D bin packing problem for multiple boxes and irregular items based on deep Q-network

Published:2023-07-10 Issue:20 Volume:53 Page:23398-23425
ISSN:0924-669X
Container-title:Applied Intelligence
language:en
Short-container-title:Appl Intell

Author:

Liu Huwei,Zhou Li,Yang Jianglong^ORCID,Zhao Junhui

Funder

the key project of Beijing Social Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence

Link

https://link.springer.com/content/pdf/10.1007/s10489-023-04604-6.pdf

Reference35 articles.

1. Ojha A, Agarwal M, Singhal A, Sarkar C, Ghosh S, Sinha R (2021) A generalized algorithm and framework for online 3-dimensional bin packing in an automated sorting center. In: 2021 Seventh Indian Control Conference (ICC). IEEE, pp 135–140

2. Wu H, Leung SC, Si Y-W, Zhang D, Lin A (2017) Three-stage heuristic algorithm for three-dimensional irregular packing problem. Appl Math Model 41:431–444

3. Wang F, Hauser K (2019) Stable bin packing of non-convex 3D objects with a robot manipulator. In: 2019 International Conference on Robotics and Automation (ICRA). IEEE, pp 8698–8704

4. Harrath Y (2022) A three-stage layer-based heuristic to solve the 3D bin-packing problem under balancing constraint. J King Saud Univ - Comput Inf Sci 34(8):6425–6431

5. Herrera-Franklin J, Rosete A, García-Borroto M (2021) A fuzzy approach for the variable cost and size bin packing problem allowing incomplete packing. Intel Artif 24(67):71–89

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Variable neighborhood genetic algorithm for multi-order multi-bin open packing optimization;Applied Soft Computing;2024-09

2. Volumetric Techniques for Product Routing and Loading Optimisation in Industry 4.0: A Review;Future Internet;2024-01-24