Name
Abstract | ||
|---|---|---|
The multiple container loading cost minimization problem (MCLCMP) is a practical and useful problem in the transportation industry, where products of various dimensions are to be loaded into containers of various sizes so as to minimize the total shipping cost. The MCLCMP can be naturally formulated as a set cover problem and solved using column generation techniques, which is a popular method for handling huge numbers of variables. However, the direct application of column generation is not effective because feasible solutions to the pricing subproblem is required, which for the MCLCMP is NP-hard. We show that efficiency can be greatly improved by generating prototypes that approximate feasible solutions to the pricing problem rather than actual columns. For many hard combinatorial problems, the subproblem in column generation based algorithms is NP-hard; if suitable prototypes can be quickly generated that approximate feasible solutions, then our strategy can also be applied to speed up these algorithms. (C) 2012 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ejor.2012.05.039 | European Journal of Operational Research |
Keywords | Field | DocType |
Packing,Column generation,Heuristic,Multiple container loading problem | Minimization problem,Set cover problem,Column generation,Mathematical optimization,Heuristic,Mathematics,Operations management,Transportation industry,Speedup | Journal |
Volume | Issue | ISSN |
223 | 1 | 0377-2217 |
Citations | PageRank | References |
13 | 0.49 | 28 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenbin Zhu | 1 | 214 | 15.34 |
| Weili Huang | 2 | 13 | 0.49 |
| Andrew Lim | 3 | 937 | 89.78 |