| Summary: | 碩士 === 國立成功大學 === 工業與資訊管理學系 === 107 === It is possible to reduce the container ship’s docking time by making good use of time to pre-arrange containers when there is no ship stopping by the quay. In order to determine the order of pre-marshalling operations, we built an integer programming model to solve it. Our research is different from current literatures since we expand the scale of the problem from a single bay to multiple bays and add corresponding restrictions to meet the situation where two RMGCs operate simultaneously. However, results showed that we can only solve small-scale problems by using Gurobi to solve the model due to the complexity of pre-marshalling problem. For medium-to-large-scale problems, we proposed a heuristic algorithm to solve it. For small-scale problems, the heuristic algorithm can obtain result that is almost the same as the model’s solution. Moreover, when it comes to the large-scale problems that model can hardly solve with, the heuristic algorithm can acquire solution within reasonable time. Our research also showed that due to considering moving containers between different bays, the pre-marshalling operations would be more efficient based on our data. Moreover, if the objective is to minimize the workload of RMGCs, using one RMGC sometimes is better than using two. However, if the objective is to minimize the finish time, almost all results suggest that using two RMGCs is better.
|
|---|
