The multiple container loading cost minimization problem

A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem

“…This set cover formulation was first proposed by Eley (2003) and later employed by Che et al (2011). The set cover formulation for both 1D and 2D bin packing problem has also been proposed by Monaci and Toth (2006).…”

“…The author first generated packing patterns using a tree search based heuristic, then used a set cover formulation for linear integer programming using pregenerated packing patterns. Che et al (2011) adapted this set cover formulation by adding a loading factor parameter to exploit the excess capacity of the chosen containers, used three fast heuristic strategies to generate packing patterns, and performed a binary search on the loading factor. Zhu, Huang, et al (2012) presented a PCG strategy for this problem to speed up the process of column generation.…”

“…We compare our GD-PCG approach with existing MCLCMP approaches in the literature on the 350 benchmark instances proposed by Che, Huang, Lim, and Zhu (2011) in Section 6.2. The results show that GD-PCG outperforms all existing approaches in terms of solution quality and average computation time.…”

Solving the Three-Dimensional Palet-Paking Problem Using Mixed 0 - 1 Model

“…width and length of the rectangular pieces to be cut out. As expected, this problem is harder to solve than the one or two-dimensional palletloading problems [3][4][5].…”

MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints

“…Other papers also proposed solution techniques for similar problems, such as the Cutting Stock Problem in which there are only a few types of boxes (e.g. Brunetta and Gregoire (2005); Che et al (2011)), or also the Single Knapsack Problem in which there is only one bin to fill with a selection of items (e.g. Ngoi et al (1994) ;Hemminki July 11, 2017 International Journal of Production Research mipbasedheuristics et al (1998)).…”