EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

A 3D Bin Packing Algorithm Addressing Wait Time and Practicality

Noriko Yokoyama, Kouhei Mori, Ryota Nakada, Yuxiang Fu, Masato Kamiya

IEEE Access · 2026 · 14 · 95038-95050

DOI: 10.1109/access.2026.3704063 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Noriko Yokoyama und 4 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Achieving sustainable logistics requires not only improving loading efficiency but also reducing truck waiting time (the total duration from arrival to departure) at logistics facilities. The three-dimensional bin packing problem (3D BPP) has been widely studied as a means to improve loading efficiency; however, most existing approaches optimize loading rate alone and do not adequately consider their impact on truck waiting time. Particularly in transfer centers, optimization with loading rate as the sole objective function often results in excessive waiting times, leading to reduced overall operational efficiency. In this study, we address this issue by proposing a practical loading optimization method that formulates the loading problem as a multi-objective optimization problem and solves it using a multi-objective genetic algorithm combined with a heuristic packing algorithm. The proposed method balances loading efficiency and truck waiting time while satisfying practical operational constraints, including weight limits, stacking constraints, and the requirement to place identical products close together. To handle uncertainty in inbound truck arrival times, the method generates loading plans in advance for multiple arrival-time scenarios. Computational experiments based on realistic transfer center settings show that, for a representative arrival-time scenario, the proposed method reduces average truck waiting time by approximately 19% compared with a conventional heuristic approach, while achieving a loading efficiency comparable to that of a method that optimizes loading rate alone. Moreover, across all evaluated arrival-time patterns, the proposed method consistently exhibits stable performance. The average computation time is 215.29 seconds for the first step and 44.2 seconds per arrival-time pattern for the second step, indicating that the proposed approach is practical for real-world operations. These results demonstrate that incorporating truck waiting time into loading optimization substantially improves the practicality and adaptability of 3D BPP solutions for transfer center operations.

Zitieren

APA

Yokoyama, N., Mori, K., Nakada, R., Fu, Y., & Kamiya, M. (2026). A 3D Bin Packing Algorithm Addressing Wait Time and Practicality. IEEE Access, 14, 95038-95050. https://doi.org/10.1109/access.2026.3704063

Vancouver

Yokoyama N, Mori K, Nakada R, Fu Y, Kamiya M. A 3D Bin Packing Algorithm Addressing Wait Time and Practicality. IEEE Access. 2026;14:95038-95050. doi:10.1109/access.2026.3704063

BibTeX
@article{Yokoyama2026,
  author = {Yokoyama, Noriko and Mori, Kouhei and Nakada, Ryota and Fu, Yuxiang and Kamiya, Masato},
  title = {A 3D Bin Packing Algorithm Addressing Wait Time and Practicality},
  journal = {IEEE Access},
  year = {2026},
  volume = {14},
  pages = {95038--95050},
  doi = {10.1109/access.2026.3704063}
}
Kostenlos starten →