MATHEMATICAL MODELS OF INTEGRATED BERTH ALLOCATION, CRANE ASSIGNMENT AND STORAGE SPACE ALLOCATON PROBLEM IN A CONTAINER TERMINAL

• Main Author: Yafie Danendra, Maulana
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/51524
• Institution: Institut Teknologi Bandung

Planning an optimum operational activities at a container terminal can help improve the efficiency of terminal’s resource usage. The planning includes berth allocation problem (BAP) to determine the berthing location of a ship, assigning a quay crane to a ship to determine the length of its service (QCAP) as well as the stacking field/storage space allocation problem (SSAP) to determine the temporary storage location for the cargo of a container ship. In this research, a mathematical model has been developed which accommodates the integration between BAP, QCAP, and SSAP which considers discrete wharf characteristics, dynamic time characteristics with due dates while also using a rolling time horizon. The objective function of the mathematical formulation of this study is to minimize the total costs incurred in planning by minimizing costs due to delays in loading and unloading services, adding quay cranes for a ship, and transportation costs due to moving containers between blocks and berths. The resulting formulation is a Mixed Integer Quadratic Programming (MIQP) model. A comparative analysis between mathematical integration model with mathematical model decomposition shows that, the integration model of berth allocation problem, quay crane assignment, and storage space allocation problem gives more optimal results with a difference of 4% compared to the decomposition model of the same problem carried out in the study.