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

Terminal administration tasks is very important due to high proportion of the transportation cost in the businesses. Berth Allocation Problem (BAP) is one of the crucial points arise in terminal administration. One of the main issues arises in real BAP is uncertainty of planning parameters. Although several researches have been accomplished in the field of BAP, uncertain parameters have not effectively been considered. In this paper, a stochastic BAP is developed. Operation time and cost of a ship are assumed to be probabilistic with both discrete and continuous distribution function in the proposed SBAP. To solve the SBAP, two solution approaches, i.e., Stochastic Chance Constraint Programming (SCCP) and Two-Stage Stochastic Linear Programming with Recourse (TSSLPR) are proposed. A numerical example is solved to show the applicability of the suggested model and the solution approaches.