An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem

The ordered open-end bin packing problem is a variant of the bin packing problem in which the items to be packed are sorted in a given order and the capacity of each bin can be exceeded by the last item packed into the bin. We present a branch-and-price algorithm for its exact optimization. The pricing subproblem is a special variant of the binary knapsack problem, in which the items are ordered and the last one does not consume capacity. We present a specialized optimization algorithm for this subproblem. The speed of the column generation algorithm is improved by subgradient optimization steps, allowing for multiple pricing and variable fixing. Computational results are presented on instances of different size and items with different correlations between their size and their position in the given order.

• Type: Journal
• Year: 2008
• Where: IOR
• Authors: Alberto Ceselli, Giovanni Righini
• Keywords: Bin Packing Problem, Binary Knapsack Problem, IOR 2008, Specialized Optimization Algorithm