The continuous dynamic berth allocation problem at a marine container terminal with tidal constraints in the access channel

We consider the problem of continuous dynamic berth allocation to containerships in a tidal seaport. In some container ports, low water depth in coastal area causes many restrictions on providing vesselʹs services. Therefore, berth allocation planning for relatively large vessels with high draft is subject to tidal conditions when the vessels are in the access channel as from anchorage area to the quay. Tidal conditions sometimes have a significant effect on possibility of entrance and departure of these ships to or from ports. Shahid Rajaee Port Complex, Iranʹs largest container seaport and the case study of this research, located at northern coast of Persian Gulf and has low water depth in its area. Historical data of seaside operations in this port is applied to the proposed model. This model also takes into account the variations of water depth in different berths. Simultaneous programming for two or more container terminals and exertion of priority and precedency coefficients based on vessel size and voyage type altogether are other attributes of this model. Here, genetic algorithm in combination with pattern search algorithm was used for solving the problem. Computational experiments have indicated that the proposed heuristic is relatively effective just for small size instances.