Model and Algorithm for Vessel Scheduling through a One-Way Tidal Channel

Abstract

Efficient vessel scheduling through a channel can improve the operational efficiency of ports. Additionally, many large vessels with a deep draft have delays related to tidal cycles when passing through tidal channels. Therefore, it is of great practical significance to study the vessel scheduling problem through a channel for which the depth is affected by the tide. In this paper, a model and an algorithm to solve the vessel scheduling problem is presented. The vessels entering the tidal channel are ordered to ensure the shortest total waiting time. The model and algorithm are then verified using actual data from the Yangtze River estuary. The results show that the scheduling efficiency is higher than other strategies, including first come first served (FCFS), random scheduling, larger draft vessels priority scheduling, and manual scheduling. Additionally, the proposed model and algorithm can be modified slightly and used for vessel scheduling through other channels with tide-affected depth.