Explanipedia

RoboBPP: Benchmarking Robotic Online Bin Packing with Physics-based Simulation Open

Wang Zhou-feng, Zhao Hang, Xu, Juzhan, Zhang Shi-shun, Xiong ZeYu , et al. · 2025

Physical feasibility in 3D bin packing is a key requirement in modern industrial logistics and robotic automation. With the growing adoption of industrial automation, online bin packing has gained increasing attention. However, inconsisten…

RoboBPP: Benchmarking Robotic Online Bin Packing with Physics-based Simulation Open

Wang Zhou-feng, Zhao Hang, Xu, Juzhan, Zhang Shishun, Xiong Zeyu , et al. · 2025

Physical feasibility in 3D bin packing is a key requirement in modern industrial logistics and robotic automation. With the growing adoption of industrial automation, online bin packing has gained increasing attention. However, inconsisten…

Collaborate sim and real: Robot Bin Packing Learning in Real-world and Physical Engine Open

Zhang Lidi, Wu, Han, Zhang Li-yu, Liu Ruofeng, Wang Hao-tian , et al. · 2025

The 3D bin packing problem, with its diverse industrial applications, has garnered significant research attention in recent years. Existing approaches typically model it as a discrete and static process, while real-world applications invol…

Collaborate sim and real: Robot Bin Packing Learning in Real-world and Physical Engine Open

Zhang Lidi, Wu, Han, Zhang Li-yu, Liu Ruofeng, Wang Hao-tian , et al. · 2025

The 3D bin packing problem, with its diverse industrial applications, has garnered significant research attention in recent years. Existing approaches typically model it as a discrete and static process, while real-world applications invol…

Box6D : Zero-shot Category-level 6D Pose Estimation of Warehouse Boxes Open

MA Yintao, Pakdamansavoji, Sajjad, Rasouli, Amir, Cao Tongtong · 2025

Accurate and efficient 6D pose estimation of novel objects under clutter and occlusion is critical for robotic manipulation across warehouse automation, bin picking, logistics, and e-commerce fulfillment. There are three main approaches in…

Box6D : Zero-shot Category-level 6D Pose Estimation of Warehouse Boxes Open

MA Yintao, Pakdamansavoji, Sajjad, Rasouli, Amir, Cao Tongtong · 2025

Accurate and efficient 6D pose estimation of novel objects under clutter and occlusion is critical for robotic manipulation across warehouse automation, bin picking, logistics, and e-commerce fulfillment. There are three main approaches in…

Random-Key Metaheuristic and Linearization for the Quadratic Multiple Constraints Variable-Sized Bin Packing Problem Open

Santos, Natalia A., Jeske, Marlon, Chaves, Antonio A. · 2025

This paper addresses the Quadratic Multiple Constraints Variable-Sized Bin Packing Problem (QMC-VSBPP), a challenging combinatorial optimization problem that generalizes the classical bin packing by incorporating multiple capacity dimensio…

Random-Key Metaheuristic and Linearization for the Quadratic Multiple Constraints Variable-Sized Bin Packing Problem Open

Santos, Natalia A., Jeske, Marlon, Chaves, Antonio A. · 2025

This paper addresses the Quadratic Multiple Constraints Variable-Sized Bin Packing Problem (QMC-VSBPP), a challenging combinatorial optimization problem that generalizes the classical bin packing by incorporating multiple capacity dimensio…

Simpele, Flexibele en Open-Source 2D Cutting & Packing Algoritmes Open

Gardeyn, Jeroen · 2025

Cutting and packing (C&P) problems involve placing items into larger containers while optimizing objectives such as minimizing waste or maximizing material yield. They arise in numerous industrial and logistical contexts where solution qua…

Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing Open

John Martinovic, Nico Strasdat · 2025

Given a set of jobs (or items), each of which is characterized by its resource demand and its lifespan, and a sufficiently large number of identical servers (or bins), the busy time minimization problem (BTMP) requires to find a feasible s…

An In-depth Study of LLM Contributions to the Bin Packing Problem Open

Herrmann, Julien, Pallez, Guillaume · 2025

Recent studies have suggested that Large Language Models (LLMs) could provide interesting ideas contributing to mathematical discovery. This claim was motivated by reports that LLM-based genetic algorithms produced heuristics offering new …

Semi-online models for cardinality constrained bin packing Open

Leah Epstein, Asaf Levin · 2025

We study two semi-online models for bin packing and exhibit them on cardinality constrained bin packing with small values of k . In this variant of the bin packing problem, each bin can have at most k items whose total size does not exceed…

A steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing Open

Julio Juárez, Jesús Guillermo Falcón-Cardona, José Carlos Ortíz-Bayliss · 2025

Green scheduling with time-of-use tariffs and machine states: Optimizing energy cost via branch-and-bound and bin packing strategies Open

Ondřej Benedikt, István Módos, Antonín Novák, Zdeněk Hanzálek · 2025

A patterning algorithm for the dynamic bin packing problem with placement groups Open

Evgeniy A. Brazhnikov, A. A. Panin, Alexey V. Ratushnyi · 2025

We consider an NP-hard problem of dynamically distributing virtual machines to servers with placement groups. For each virtual machine, parameters such as required number of resources and creation and deletion timestamps are known. Each se…

A Two-Stage Bin Packing Algorithm for Minimizing Machines and Operators in Cyclic Production Systems Open

Yossi Hadad, Baruch Keren · 2025

This study presents a novel, two-stage algorithm that minimizes the number of machines and operators required to produce multiple product types repeatedly in cyclic scheduling. Our algorithm treats the problem of minimum machines as a bin …

Genetic programming policies for bin packing in the framework of deterministic Markov decision process Open

Jesús Quesada, Francisco Javier Gil-Gala, Marko Đurasević, María R. Sierra, Ramiro Varela · 2025

The Bin Packing Problem (BPP) is a well-known NP-hard problem with numerous real-world applications. This study focuses on minimizing waste and maximum lateness in a one-dimensional version of the BPP, which is particularly relevant in ind…

Modular Coordination of Vehicle Routing and Bin Packing Problems in Last Mile Logistics Open

Nikica Perić, Anđelko Kolak, Vinko Lešić · 2025

Background: Logistics and transport, core of many business processes, are continuously optimized to improve efficiency and market competitiveness. The paper describes a modular coordination of vehicle routing and bin packing problems that …

The 2-D Bin Packing Problem with Multiple Levels of Prioritization: A Spatial Optimization Perspective Open

William Kirschenman, H. Sebastian Heese, Michael G. Kay, Russell E. King, Brandon M. McConnell · 2025

This paper integrates two-dimensional bin packing with facility layout concepts to address scenarios in which items must not only fit within a confined space but also be arranged according to spatial priorities. We embed a prioritization m…

Efficient Airspace Scheduling for Military Exercises: A 3D Bin Packing Approach Open

S. M. D. Day, Dianjun Fang, Ludwig Weber, Ryan Messer, John Anthony Miller , et al. · 2025

Emerald Flag is a military exercise hosted by the 96th Test Wing at Eglin Air Force Base, FL. In its latest iteration, 10 aircraft platforms flew 26 total missions over two days. The current manual airspace allocation process is not only h…

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

Mariusz Kaleta, Tomasz Śliwiński · 2025

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…

Design Space Exploration based on Q-Learning for 2D Bin-packing Problems Open

Maria Pantazi-Kypraiou, George Rafael Goudroumanis, Tahani Aladwani, Athanasios Tziouvaras, George Stamoulis , et al. · 2025

Improved Maximin Share Approximations for Chores by Bin Packing Open

Jugal Garg, Xin Huang, Erel Segal-Halevi · 2025

We study fair division of indivisible chores among n agents with additive cost functions using the popular fairness notion of maximin share (MMS). Since MMS allocations do not always exist for more than two agents, the goal has been to imp…

Near-optimal Algorithms for Stochastic Online Bin Packing Open

Nikhil Ayyadevara, Rajni Dabas, Arindam Khan, Kidambi Sreenivas · 2025

We study the online bin packing problem under two stochastic settings. In the bin packing problem, we are given n items with sizes in \((0,1]\) and the goal is to pack them into the minimum number of unit-sized bins. First, we study bin pa…

Correction: Layout optimization of irregular storage areas under class storage strategy based on clustering and multi-bin size packing problem Open

Wenbin Zhang, Yi Jin, Huarong Zhang, Yiming Wang · 2025

[This corrects the article DOI: 10.1371/journal.pone.0307218.].

Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard Open

György Dósa, András Éles, Angshuman R. Goswami, István Szalkai, Źsolt Tuza · 2025

In this work, the Bin Packing combinatorial optimization problem is studied from the practical side. The focus is on the Falkenauer T benchmark class, which is a collection of 80 problem instances that are considered hard to handle algorit…

ASAP: Learning Generalizable Online Bin Packing via Adaptive Selection After Proposal Open

Han Fang, Paul Weng, Yutong Ban · 2025

Recently, deep reinforcement learning (DRL) has achieved promising results in solving online 3D Bin Packing Problems (3D-BPP). However, these DRL-based policies may perform poorly on new instances due to distribution shift. Besides general…

Beyond the Hype: Benchmarking LLM-Evolved Heuristics for Bin Packing Open

Kevin Sim, Quentin Renau, Emma Hart · 2025

Coupling Large Language Models (LLMs) with Evolutionary Algorithms has recently shown significant promise as a technique to design new heuristics that outperform existing methods, particularly in the field of combinatorial optimisation. An…

A Hybrid Approach Combining Ant Colony Optimization and Column Generation for Solving the 3d Bin Packing Problem with Rotation Open

Daniel Bento Maia, Denis Borenstein · 2025

Solving 0-1 Knapsack and Bin Packing Problem Using Logical Social Group Optimization Open

Rahul Das, Junali Jasmine Jena, Suresh Chandra Satapathy, Naeem M. S. Hannoon · 2025

The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in the real world such as in resource allocation, lo…

Bin packing problem