Log In Sign Up

A Constructive Heuristic Algorithm for 3D Bin Packing of Irregular Shaped Items

by   Qiruyi Zuo, et al.

The three-dimensional bin packing problem (3D-BPP) plays an important role in city logistics and manufacturing environments, due to its direct relevance to operational cost. Most existing literature have investigated the conventional 3D-BPP, in which the shape of items are typically considered as regular shapes, e.g., rectangular-shaped rigid boxes or cylindrical-shaped containers. However, 3D-BPP for non-rectangular shaped items are quite common in varies delivery schemes, especially in fresh food delivery, and few published studies focusing on these issues. In this paper, we address a novel 3D-BPP variant in which the shape changing factor of non-rectangular and deformable items is incorporated to further enhance the loading efficiency and reduce the operational cost of related companies. Motivated by the compression process of item-loading, we propose a constructive heuristic (i.e., an improved dynamic-volume-based packing algorithm) to solve the studied problem. Experimental results over a set of randomly generated instances reveal that considering shape changing factor is indeed able to achieve higher space utilization than that of conventional schemes, thereby has potential to save packaging and delivering cost, as well as enhance operation efficiency.


page 2

page 3

page 9


Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More

In the 2-Dimensional Knapsack problem (2DK) we are given a square knapsa...

On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem

In two-dimensional geometric knapsack problem, we are given a set of n a...

A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System

Packing cost accounts for a large part of the e-commerce logistics cost....

Shapes In A Box – Disassembling 3D objects for efficient packing and fabrication

Modern 3D printing technologies and the upcoming mass-customization para...

Adaptive Simulated Annealing with Greedy Search for the Circle Bin Packing Problem

We introduce a new bin packing problem, termed the circle bin packing pr...

A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem

The Two-dimensional Bin Packing Problem calls for packing a set of recta...

Stochastic Extensible Bin Packing

We consider the stochastic extensible bin packing problem (SEBP) in whic...