Berth allocation optimization with priority based on simulated annealing algorithm

Existing berth-quay crane (QC)-integrated allocation models aim to minimize the total time of vessels at port or the total cost of vessels' berthing and handling. The service fairness of vessels is considered, but service priority to VIP customers is overlooked, thereby causing poor service satisfaction from berthing operations. A multi-objective continuous berth allocation model with priority was proposed in this study to address this problem. The proposed model explored the relationship among penalty cost, fairness, and priority of VIP customers and designed weight vectors for penalty cost and fairness on the basis of an analysis of berth waiting time, preference berth allocation, and QC allocation. A two-factor neighbourhood searching strategy was then implemented for berthing sequence and berthing position through the simulated annealing algorithm with considerations for priority, thereby solving the model rapidly. Different parameter strategies in the model were compared and verified by experiments. Results demonstrate that the continuous berth allocation model with priority ensures fairness of overall service in berth allocation and priori berthing of VIP customers. The simulated annealing algorithm can be superior to other heuristic algorithms in solving the model. Conclusions in this study offer theoretical bases for berthing service satisfaction on the port side and are conducive to the optimization of berth allocation.