The two-dimensional vector packing problem with courier cost structure

Abstract

The two-dimensional vector packing problem with courier cost structure is a practical problem faced by many manufacturers that ship products using courier service. The manufacturer must ship a number of items using standard-sized cartons, where the cost of a carton quoted by the courier is determined by a piecewise linear function of its weight. The cost function is not necessarily convex or concave. The objective is to pack all items into cartons such that the total delivery cost is minimized while observing both the weight limit and volume capacity constraints. In this study, we investigate solution methods to this problem. © 2013 Springer-Verlag.