英文摘要 |
Container slot assignment, a preplanning procedure for container stowage, is to allocate container boxes into certain slots. However, not all the attributes ofthe boxes are known in advance and most operators assign the slots via experience, as a consequence, conventional container slot assignment often causes inefficient usage of slot capacities with unproductive moves which represents an increase in operation cost. By analyzing the problem of container slot assignment, this study attempts to formulate the container slot assignment problem as an integer programming model to minimize the number of unproductive moves. The model can be solved by LINGO package Through the examples and sensitivity analysis, it is found that the global optimal solutions for this integer programming slot assignment model are existent but not unique. Increasing the number of ground slots can reduce the number of shufflingand shifting moves; however, lowering the number of stacking layers will increase the unproductive moves. |