컨테이너 터미널에서 안벽크레인을 고려한 선석계획 수립

Abstract

The berth allocation problem with quay crane in container terminal

Won Bong Lee

Department of Systems Management & Engineering Graduate School of Industry, Pukyong National University

Abstract

This study considers how to assign berth and crane in a container terminal to a ship for more efficient schedule. This study is a constraint satisfaction problem in which cranes and berths should be assigned in such a way all the space and time constraints are satisfied without any interference. First we made the mathematical model for the decision making. It includes the three CC (Container crane) assignment options for determining which one is more efficient allocation. Then, using LINGO software, the optimal solution for the mathematical model can be found. A numerical example is given to verify the model and its solution. Futhermore we developed a GA (Genetic Algorithms). And we compared the results of GA with LINGO optimal solutions using a real data from Pusan East Containter Terminal and it showed that our study can derive a schedule of satisfactory quality.