A Multi-Heuristic Algorithm for Multi-Container 3-D Bin Packing Problem Optimization Using Real World Constraints
With the growing demand for sustainable and optimal packaging solutions, this study proposes a novel two-stage algorithm for the multi-container three-dimensional bin packing problem. The research addresses this problem within the context of a real-world industrial scenario and implements several pr...
Main Authors: | Anan Ashrabi Ananno, Luis Ribeiro |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10473069/ |
Similar Items
-
Space Splitting and Merging Technique for Online 3-D Bin Packing
by: Thanh-Hung Nguyen, et al.
Published: (2023-04-01) -
Integrating Heuristic Methods with Deep Reinforcement Learning for Online 3D Bin-Packing Optimization
by: Ching-Chang Wong, et al.
Published: (2024-08-01) -
Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard
by: György Dósa, et al.
Published: (2025-02-01) -
Optimizing Container Fill Rates for the Textile and Garment Industry Using a 3D Bin Packing Approach
by: Nguyen Thi Xuan Hoa
Published: (2024-06-01) -
Online Three-Dimensional Bin Packing: A DRL Algorithm with the Buffer Zone
by: Zhang Jiawei, et al.
Published: (2024-02-01)