Key points are not available for this paper at this time.
In this paper, we focus on the online 3D bin packing problem, a classical strong NP-hard problem. In the problem, each item is unknown before bin packing is performed, and the arrival of the item requires immediate bin packing, which has many applications in industrial automation. In this paper, we propose a greedy algorithm for multi-indicator fusion to solve this problem by defining a series of evaluation indicators during bin packing, determining the weights of these indicators to be fused by SVR algorithm and Quasi-Newton Methods, and finally selecting the placement with the highest score of the fused indicators to be placed. The experimental results show that this method can solve the online 3D bin packing problem and is competitive with other algorithms in terms of space utilization and the number of bins, and the running time is fully completed to meet the online bin packing requirements.
Ma et al. (Sat,) studied this question.