A Heuristic Algorithm for the Three-Dimensional Container Packing Problem with Zero Unloading Cost Constraint

Home delivery is one of the most important cost drivers in the e-commerce industry, and a recent study concluded that over 40% cost reduction for the dotcom companies can be achieved by offering home delivery system. This paper considers the home delivery system to cope with the three-dimensional container packing problem (3DCPP), which is a crucial issue among logistics operations to pack a number of rectangular items (cargos) orthogonally onto a rectangular container so that the utilization rate of the container space is maximized. In our framework of home delivery, we assume that the routing of a consignment is given, and hence there is an order of unloading items with respect to a problem. If loading items doesn't take the unloading order into account, then it may lead to huge unloading costs (i.e., unloading and reloading other items many times). In this paper, the unloading cost with respect to a packing pattern is precisely defined according to the invisible and untouchable rule and an iterative heuristic algorithm based on the sub-volume scheme is proposed. Our approach is compared with the previous approaches by using standard benchmark data set, and our experimental results suggest our approach to be promising, as it can generate the packing patterns without unloading cost, which has a high utilization ratio, and the benchmark problems can be executed efficiently.

[1]  Jan Holmström,et al.  How good receipt affects e grocery efficiency , 2000 .

[2]  M. Aboelmaged,et al.  Distribution systems for electronic commerce , 2000, Proceedings of the 2000 IEEE International Conference on Management of Innovation and Technology. ICMIT 2000. 'Management in the 21st Century' (Cat. No.00EX457).

[3]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[4]  Mikko Punakivi,et al.  Developing Cost-effective Operations for the e-Grocery Supply Chain , 2002 .

[5]  E. E. Bischoff,et al.  Issues in the development of approaches to container loading , 1995 .

[6]  Katsuhisa Ohno,et al.  An Efficient Approach for the Three-Dimensional Container Packing Problem with Practical Constraints , 2004, Asia Pac. J. Oper. Res..

[7]  J. A. George,et al.  A heuristic for packing boxes into a container , 1980, Comput. Oper. Res..

[8]  John E. Beasley,et al.  An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure , 1985, Oper. Res..

[9]  G. Abdou,et al.  3D random stacking of weakly heterogeneous palletization problems , 1999 .

[10]  M. Punakivi,et al.  Identifying the success factors in e‐grocery home delivery , 2001 .

[11]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[12]  Hermann Gehring,et al.  A Genetic Algorithm for Solving the Container Loading Problem , 1997 .

[13]  Daniel Mack,et al.  A parallel tabu search algorithm for solving the container loading problem , 2003, Parallel Comput..

[14]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[15]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[16]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[17]  Loris Faina.  A global optimization algorithm for the three-dimensional packing problem , 2000, Eur. J. Oper. Res..

[18]  Chin-Sheng Chen,et al.  An analytical model for the container loading problem , 1995 .

[19]  G. Abdou,et al.  A SYSTEMATIC APPROACH FOR THE THREE-DIMENSIONAL PALLETIZATION PROBLEM , 1994 .

[20]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .