Online Three-Dimensional Bin Packing: A DRL Algorithm with the Buffer Zone
The online 3D bin packing problem(3D-BPP) is widely used in the logistics industry and is of great practical significance for promoting the intelligent transformation of the industry. The heuristic algorithm relies too much on manual experience to formulate more perfect packing rules. In recent year...
Main Authors: | Zhang Jiawei, Shuai Tianping |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2024-02-01
|
Series: | Foundations of Computing and Decision Sciences |
Subjects: | |
Online Access: | https://doi.org/10.2478/fcds-2024-0005 |
Similar Items
-
Space Splitting and Merging Technique for Online 3-D Bin Packing
by: Thanh-Hung Nguyen, et al.
Published: (2023-04-01) -
Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation
by: Ren, Runtian, et al.
Published: (2017) -
Identify Patterns in Online Bin Packing Problem: An Adaptive Pattern-Based Algorithm
by: Bingchen Lin, et al.
Published: (2022-06-01) -
Robust Optimization for the Two-Dimensional Strip-Packing Problem with Variable-Sized Bins
by: Kaiyuan Liu, et al.
Published: (2023-11-01) -
AN OFF-LINE DUAL MAXIMUM RESOURCE BIN PACKING MODEL FOR SOLVING THE MAINTENANCE PROBLEM IN THE AVIATION INDUSTRY
by: GEORGE CRISTIAN GRUIA, et al.
Published: (2013-05-01)