The Berth Allocation Problem (BAP): Study Case at PT Koja International Container Terminal Jakarta Indonesia
Vivian Karim Ladesi (a*), Siti Sahara (b)

a) Department of Transportation, Port Management Study, Universitas Negeri Jakarta, Jakarta 13220, Indonesia
*vivian_ladesi[at]unj.ac.id
b) Department of Transportation, Port Management Study, Universitas Negeri Jakarta, Jakarta 13220, Indonesia

Abstract

The berth allocation problem (BAP) is part of the key decision problems at port terminals. The BAP becomes important to the operational efficiency of a port for reducing the total cost because at the tactical level in order to achieve the optimal allocation which is used as a basis for making a deal between terminal operators and shipping lines which will determine the length of berth time vessels in port. Most of the tactical BAP models have used the assumption of deterministic situation where arrival time and number of containers are known in advance. Deterministic situations like that will be difficult to happen in real life. Therefore, this work tries to show the stochastic behavior of the BAP at PT Koja International Container Terminals, Jakarta as a case. The results provide the stochastic illustration as the difference between the estimated and the actual arrival or departure time of vessels as well as the variations and fluctuations in the amount of container loading and unloading at each different time

Keywords: Port; berth allocation; scheduling; uncertainty

Topic: Industry Engineering