A three-stage layer-based heuristic to solve the 3D bin-packing problem under balancing constraint
This research investigates the Three Dimensional-Single Bin-Size Bin-Packing Problem (3D-SBSPP). The aim is to pack n boxes of different dimensions and weights into a minimum number of equally balanced bins. The boxes can be rotated according to six possible orientations. Balancing the bins, volume...
Saved in:
| Main Author: | Youssef Harrath |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2022-09-01
|
| Series: | Journal of King Saud University: Computer and Information Sciences |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1319157821001749 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing
by: Julio Juárez, et al.
Published: (2025-07-01) -
Applying Gene Expression Programming for Solving One-Dimensional Bin-Packing Problems
by: Najla Al-Saati
Published: (2013-12-01) -
Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard
by: György Dósa, et al.
Published: (2025-02-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) -
A patterning algorithm for the dynamic bin packing problem with placement groups
by: Evgeniy A. Brazhnikov, et al.
Published: (2025-06-01)