Article ID: | iaor20117321 |
Volume: | 214 |
Issue: | 3 |
Start Page Number: | 501 |
End Page Number: | 511 |
Publication Date: | Nov 2011 |
Journal: | European Journal of Operational Research |
Authors: | Lim Andrew, Zhu Wenbin, Che Chan Hou, Huang Weili |
Keywords: | containers |
In the shipping and transportation industry, there are several types of standard containers with different dimensions and different associated costs. In this paper, we examine the multiple container loading cost minimization problem (MCLCMP), where the objective is to load products of various types into containers of various sizes so as to minimize the total cost. We transform the MCLCMP into an extended set cover problem that is formulated using linear integer programming and solve it with a heuristic to generate columns. Experiments on standard bin‐packing instances show our approach is superior to prior approaches. Additionally, since the optimal solutions for existing test data is unknown, we propose a technique to generate test data with known optimal solutions for MCLCMP.