Search

This study aims to optimize the docking program of oil tankers. Data set is collected from three hundred docking ships in order to solve the problem. The evaluated problem is known in the literature as the discrete berth allocation problem. One of the main purposes of the berth allocation problem is to determine the docking sequence of ships by minimizing the waiting time of each ship in the dock. To that end, we used integer linear programming. Tonnage and draft constraints of the docking ships were also taken into consideration in the model. In addition, was developed a metaheuristic algorithm converges the result to the most reasonable solution, especially in large-scale problems. Integer linear programming successfully solved the problem of the small sample group. Also, the simulated annealing algorithm developed for larger sample groups provided the same results, however, in a shorter timeframe than the integer model. In conclusion, it has been understood that both methods were strong and applicable depending on the planning horizon in small-size problems. In big-size problems, it has been detected that simulated annealing algorithms were applicable. [ABSTRACT FROM AUTHOR]