Two dimensional vector packing problem with volumetric weight and general costs (2DVPP-VWGC)
The volumetric weight of a package has become an essential factor in calculating the delivery cost of shipments in the international logistics market. In this work, we extend the two-dimensional vector packing problem by considering a more realistic cost structure which is a general function of volumetric weight. The problem is to pack a set of different items into some identical bins without violating weight limits and volume capacities so that the total delivery cost is minimized. We develop an exact approach based on a branch-and-price algorithm and subset-row inequalities for the problem. To efficiently solve the pricing problems in column generation, a label-setting algorithm with an effective label dominance rule is presented. A stronger label dominance rule is derived for the case where the cost function is convex. The computational results show that the exact method is effective in solving the various test instances of the problem. If the volumetric weight is not considered, the exact method can be adapted to solve the two-dimensional vector packing problem with piecewise linear cost function and outperformed the existing exact algorithm by finding 28 more optimal solutions.