An optimization framework for the Box Sizing Problem

The box sizing problem(BSP) is a new and complex optimization problem caused by supply chain strategy changes. To shift repacking process from the retailer side to the supplier side, a redesign of box sizes is needed for the boxes in which various products are packed, so that the total volume utilization rate of packing is maximized for shipping the required demand of products. This paper presents an cut/pack/select(CPS) framework, which decomposes the BSP into several subproblems to reduce complexity. We use this framework and an IP model to solve the original problem while making use of the existing heuristic algorithm of another optimization problem, the Container Loading Problem, which is well-studied. Physical and managerial issues are considered and included in the problem modeling. We also prove that the box sizes can be determined before the demand of products is fixed. Numerical results and analysis show that the solutions are generated time-efficiently and in good quality by our framework.