Seaside operations modeling and selecting an algorithm for solving

In recent years, with the increasing growth of globalization and facilitation of freight transportation by sea, the importance of maritime transportation has become more than ever. Since ports are important hubs in the maritime network and have a direct impact on the maritime transportation process, the importance of port operations planning, minimizing the cost of operations, has become increased. One of the port planning subjects is seaside operations. seaside operations include three subjects: Berth Allocation Problem, Quay Crane Assignment Problem, and Quay Crane Scheduling Problem. This paper intends to develop and solve integrated model for these three subjects to achieve an optimal plan for seaside operations. This paper uses the heuristic algorithm, dynamic programming, to solve quay crane scheduling problem and 5 metaheuristic algorithms (GA, PSO, ACO, ICO, TS) to solve berth allocation and quay crane assignment problem and finally compares the performance of these algorithms. The results show the better performance of the genetic algorithm in solving seaside operations problems. To validate the results of this paper, the data of two container terminals of Shahid Rajaei port have been used.