Rescheduling the initial berth plan in the disruption environment

Ports are important hubs that connect maritime transport to other modes. For this reason, ports are considered important infrastructures for freight transportation, trade, and the global economy. Therefore, optimizing port plans and operations will play a significant role in port costs and revenues. Berth planning is part of port operations that includes two problems; Berth Allocation Problem (BAP) and Quay Crane Assignment Problem (QCAP). The optimal solution to these two problems can affect the freight transportation speed and cost. This paper integrated modeling two problems BAP and QCAP, and solved them using four metaheuristic algorithms (GA, ICA, TS, ACO). Whereas berth planning is in a disrupted environment and unforeseen events may occur during the program's execution, incurring additional costs for the port, or even stopping the initial plan execution, rescheduling the original berth plan is necessary. This paper uses two methods (global and local rescheduling) with metaheuristic algorithms to find the optimal method for berth rescheduling. Numerical analysis shows the proper performance of GA and ICA algorithms in solving the initial berth planning model and the global rescheduling method. In contrast, for local rescheduling, the ACO algorithm has better performance. Evaluation and validation of models and methods of solving this paper are done using the data of ships' arrival and departure in Shahid Rajaei port.