Abstract
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 container 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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Che, C. H., Huang, W., Lim, A., & Zhu, W. (2011). A heuristic for the multiple container loading cost minimization problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6704 LNAI, pp. 276–285). https://doi.org/10.1007/978-3-642-21827-9_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
