The dissertation project in my last year in UNNC. Applied Deep Reinforcement Learning approaches to solve 1D online bin packing problems.
-
The items are revealed dynamically over time and their information is not available until after they arrive. Item arrived must be packed at once.
-
Items in each bin cannot be moved or rearranged.
Monte-Carlo Tree Search
Proximal Policy Optimization
Modified version of Pointer Network