In this paper, a new type of 3D bin packing problem (BPP) is proposed, in which a number of
cuboid-shaped items must be put into a bin one by one orthogonally. The objective is to find …

In this paper, we address the Bin Packing Problem with Compatible Categories (BPCC), a
challenging optimization problem that arises in the context of last mile distribution to …

The well-known one-dimensional Bin Packing Problem (BPP) of whose variants arise in
many real life situations is a challenging NP-Hard combinatorial optimization problem …

Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

Robotic 3D bin packing (R‐3dBPP), aiming to place deformed cases in various sizes in the
container without fences, is a comprehensive application that includes perception, planning …

In this paper, we study the Variable-Sized Bin Packing Problem with Conflicts and Item
Fragmentation (VSBPPC-IF) that has applications such as (i) the delivery planning of …

This paper studies the two-dimensional bin-packing problem with conflicts and load
balancing in logistics. Given a set of rectangular items which may conflict with each other …

In this paper, we study the Bin Packing Problem with Conflicts and Item Fragmentation
(BPPC-IF) which has applications in the delivery and storage of items that cannot be packed …

Integrating far-distant suppliers, eg, from low-wage countries and other currency areas, into
concerted just-in-time (JIT) supply concepts is a delicate planning task. One enabler, eg …

We propose an iterated local search based on several classes of local and large
neighborhoods for the bin packing problem with conflicts. This problem, which combines the …