The berth allocation scheduling problem: A case study in Tan Cang Cai Mep port (CMIT port - Cai Mep International Terminal Co., Ltd)

Abstract

Berth allocation problem is a typical problem in seaport all around the world. The objective of this problem is assign vessels in suitable berth so that minimize waiting time and departure late time. In this research, we have solved the berth allocation problem at CMIT port using mathematical model. We have applied a MILP model and solved it by CPLEX 12.6. The result from the model is compared with the manual plan. The plan from model is prove to be better the manual plan in 3 criteria: number of ship late, total hour late, the idle time of berth. The result is feasible and can be apply in the real world. Some minor issue should be concerned when apply this method is the data collection and time run CPLEX model is about 2 hours with computer core i5, ram 16GB. Our next step is build a heuristic so that can solve is problem more effectively. Keywords: Berth allocation problems, seaport planning, minimize waiting time, minimize departure late, and minimize berth idle time