Effective Online 3D Bin Packing with Lookahead Parcels Using Monte Carlo Tree Search
Open Access
- 20 April 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 2184-2195
Abstract
No abstract availableAll Related Versions
Funding Information
- Fundamental and Interdisciplinary Disciplines Breakthrough Plan of the Ministry of Education of China (no. JYB2025XDXM108)
This publication has 18 references indexed in Scilit:
- A deep reinforcement learning approach for online and concurrent 3D bin packing optimisation with bin replacement strategiesComputers in Industry, 2024
- MILP Acceleration: A Survey from Perspectives of Simplex Initialization and Learning-Based Branch and BoundJournal of the Operations Research Society of China, 2023
- Monte Carlo Tree Search: a review of recent modifications and applicationsArtificial Intelligence Review, 2022
- Deep learning, reinforcement learning, and world modelsNeural Networks, 2022
- Cyber-Physical Systems in the Context of Industry 4.0: A Review, Categorization and OutlookInformation Systems Frontiers, 2022
- On-line three-dimensional packing problems: A review of off-line and on-line solution approachesComputers & Industrial Engineering, 2022
- A Generalized Bin Packing Problem for parcel delivery in last-mile logisticsEuropean Journal of Operational Research, 2019
- Radio frequency identification enabled wireless sensing for intelligent food logisticsPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2014
- Breadth-first heuristic searchArtificial Intelligence, 2006
- A Hybrid Genetic Algorithm for Packing in 3D with Deepest Bottom Left with Fill Method2004