한국항만학회지 (Journal of Korean Port Research)
- 제9권2호
- /
- Pages.1-8
- /
- 1995
- /
- 1225-0791(pISSN)
발견적 알고리즘에 의한 컨테이너 터미널의 선석배정에 관한 연구
A Heuristic Algorithm of Berth Assignment Planning in a Container Terminal
- 발행 : 1995.12.01
초록
Generally, berth assignment problem has conflicting factors according to the interested parties. In the view of shipping company, it is desirable that berth assignment is made according to the order of arrival. But in the view of port operator, it is better to be assigned regardless the order of arrival to promote the efficiency of berth operation. Thus, it is necessary to establish berth assignment planning which reflects both of interests in a practical situation. This paper aims to develop a reasonable berth assignment algorithm in a container terminal by considering the prescribed factors, and suggests three types of models minimizing the objective functions such as total port staying time, total mooring time and total maximum mooring time by using MPS concept. These models are formulated by 0-1 integer programming and min-max type function, but as the number of variables increases, an optimal solution cannot be achieved easily within a desired computational time. Thus, to tackle this problem this paper proposes a heuristic algorithm, and also the heuristic algorithm proposed in this paper is verified through the several examples.
키워드