With increasing ship's speed turnround and port time becomes a large percentage of total roundtrip time and this causes to accelerate the introduction of the various kind of modern handling equipment, the standardization of cargoes, and the improvement of the ship. However, it is still a drag on efficient operation of ship. Similarly, the turnround time at the container port is very important as a measure for the decision of the efficiency of port. To decrease operating coasts, the minimization of the time need to cargo handling at the ports of call must be achieved. Thus the optimization of the time need to cargo handling at the ports of call must be achieved. Thus the optimized Container Loading Plan is necessary, especially under the rapid speed of container operations. For the container loading plan, in this thesis, we use the hungarian method and the branch and bound method to get the initial disposition of both maximization of ship's GM and minimization of shift number to the obstructive container in a yard area. We apply the dynamic programming algorithm to get the final disposition for minimizing total turnroudn time and finally we analyzed the results to check whether the initial disposition is proper or not.

• 강기중
• 이철영