Probabilistic Multi-Period Berth Allocation Problem: Continuous and Discrete Approaches

As global trade flourishes, terminals endeavor to get higher income while adapting to an expanded intricacy concerning terminal administration tasks. Perhaps the most common issues such terminals encounter is the Berth Allocation Problem (BAP), which involves allotting vessels to a bunch of berths and time allotments while at the same time limiting goals, for example, total stay time or total assignment cost. Complex formats of actual terminals present spatial constraints that restrict the mooring and departure of vessels. In spite of the fact that significant research has been carried out with regard to the BAP, these real-world limitations have not been considered in an overall manner. In this paper, a stochastic Multi-Period Berth Allocation-Scheduling Problem in Different Terminals with Irregular Layouts (SBAP) considering multi-Period modes, generalized precedence relations are developed. To solve the (SBAP), a solution approach based on Stochastic Chance Constraint Programming (SCCP) and a solution approach based on Two-Stage Stochastic Linear Programming with Recourse (TSSLPR) is proposed. A mathematical model is solved to show the applicability of the suggested model and solution approach.