Neural-Driven Constructive Heuristic for 2D Robotic Bin Packing Problem

Mariusz Kaleta

doi:10.3390/electronics14101956

Return

Neural-Driven Constructive Heuristic for 2D Robotic Bin Packing Problem

2025-05-11

Mariusz Kaleta *

Tomasz Śliwiński

DOI：10.3390/electronics14101956

Original

Original request for help

Save

Abstract

En 中文

This study addresses the two-dimensional weakly homogeneous Bin Packing Problem (2D-BPP) in the context of robotic packing, where items must be arranged in a manner feasible for robotic manipulation. Traditional heuristics for this NP-hard problem often lack adaptability across diverse datasets, while metaheuristics typically suffer from slow convergence. To overcome these limitations, we propose a novel neural-driven constructive heuristic. The method employs a population of simple feed-forward neural networks, which are trained using black-box optimization via the Covariance Matrix Adaptation Evolution Strategy (CMA-ES). The resulting neural network dynamically scores candidate placements within the constructive heuristic. Unlike conventional heuristics, the approach adapts to instance-specific characteristics without relying on predefined rules. Evaluated on datasets generated by 2DCPackGen and real-world logistic scenarios, the proposed method consistently outperforms benchmark heuristics such as MaxRects and Skyline, reducing the average number of bins required across various item types and demand ranges. The most significant improvements occur in complex instances, with up to 86% of 2DCPackGen cases yielding superior results. This heuristic offers a flexible and extremely fast, data-driven solution to the algorithm selection problem, demonstrating robustness and potential for broader application in combinatorial optimization while avoiding the scalability issues of reinforcement learning-based methods.

Keywords:

bin packing problem

cutting stock problem

robotic packing

constructive heuristic

neural networks

black-box optimization