Comparative analysis of berth allocation problem solving under different berth function assigning

Abstract

This paper focuses on the efficiency analysis of berth allocation problem under the different berth function assigning. The consideration of berth function assigning is divided in two cases: multi-purpose berth and single-purpose berth. The discrete and dynamic problem of berth allocation problem with multi-purpose berth and single-purpose berth are investigated. To solve the resulting problem, a mixed-integer programming model is proposed to find the optimal solutions for both scenarios. Furthermore, numerical experiments are carried on randomly generated instances to assess the effectiveness of the proposed model and comparative analysis in the different berth function. Computational examples show that the performance of berth allocation problem with multi-purpose berth outperforms the single-purpose berth in term of total service time of vessel and confirm that the multi-purpose berth is increased flexibility in port operation management in case of fluctuate demand.