A Berth Assignment Planning for a Public Terminal

공공터미널의 선석배정계획에 관하여

A berth assignment problem has a direct impact on assessment of charges made to ships and goods. A berth can be assigned to incoming vessels and operated in tow different ways: as a common user berth, as a preference berth. A common user berth is a berth that any ship calling at a port may be permitted to use according to her time of arrival and to priorities as determined by the port authority. In this paper, we concerned with various types of mathematical programming models for a berth assignment problem to achive an efficient berth operation. In this paper, we focus on a reasonable berth assignment programming in a public container terminal in consideration of trade-off between server and user. We propose a branch and bound algorithm & heuristic algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) with which the trade-off between servers and users can be considered. The berth assignment problem is formulated by min-max and 0-1 integer programming and developed heuristic algorithm to solve the problem more easily instead of branch and bound method. Finally, we gave the numerrical solutions of the illustrative examples.