论文信息 - A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem

A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem

Abstract In this paper we consider the three-dimensional bin packing problem (3D-BPP), when the bins are identical with the aim of minimizing the number of the used bins. We introduce a mixed-integer linear programming formulation (MILP1). Some special valid inequalities will be presented in order to improve the relaxed lower bound of MILP1. A large set of experimental tests has been carried out. The obtained results show that our method provides a satisfactory performance.

[1] Marco A. Boschetti. New lower bounds for the three-dimensional finite bin packing problem , 2004, Discret. Appl. Math..

[2] Abdelghani Bekrar,et al. An Exact Method for the 2D Guillotine Strip Packing Problem , 2009, Adv. Oper. Res..

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

[4] Sándor P. Fekete,et al. An Exact Algorithm for Higher-Dimensional Orthogonal Packing , 2006, Oper. Res..

[5] Sándor P. Fekete,et al. New Classes of Lower Bounds for Bin Packing Problems , 1998, IPCO.

[6] Shimon Even,et al. Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .

[7] Sándor P. Fekete,et al. New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

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