Distributionally robust chance-constrained optimization for the integrated berth allocation and quay crane assignment problem

Abstract

In this paper, we are the first to propose a distributionally robust chance-constrained (DRCC) optimization model for the integrated berth allocation and quay crane assignment problem (BACAP) in container terminals. In contrast to the classical deterministic BACAP model, we consider the arrival time to be uncertain due to the frequent arrival delays in ports. We then impose a chance constraint that the service time must start after the uncertain arrival time with a probability of at least 1−ϵ, where 1−ϵ represents the target service level in container terminals (ϵ represents the target risk tolerance of the port manager). Under the moment-based ambiguity set, we reformulate the DRCC model into a mixed integer semi-definite programming (MISDP) model. Additionally, we develop an efficient decomposition branch-and-bound algorithm to solve the MISDP model and obtain the exact solution. Fortunately, a special case of the DRCC model arises when the mean and covariance utilized in the ambiguity set are precise, allowing for the transformation of the DRCC model into a mixed integer programming (MIP) model. This conversion significantly reduces the complexity of the problem. Impressively, the solving time of the MISDP model with the decomposition branch-and-bound algorithm is comparable to that of the transformed MIP model. The numerical results show that our model can achieve a schedule with high service at low cost. Meanwhile, we have made an intriguing discovery that the correlation between the target risk tolerance and the actual service level can be depicted as a staircase function regardless of the datasets. This finding offers crucial insights for port management, enabling them to strike a balance between the cost and actual service level by determining an appropriate target service level.