کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
476918 | 1446093 | 2011 | 11 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: The multiple container loading cost minimization problem The multiple container loading cost minimization problem](/preview/png/476918.png)
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.
► Examined the multiple container loading cost minimization problem.
► Proposed set cover formulation with heuristics to generate columns.
► Outperforms existing approaches on existing bin-packing test data.
► Generated new benchmark data with known non-perfect optimal solutions.
Journal: European Journal of Operational Research - Volume 214, Issue 3, 1 November 2011, Pages 501–511