In this work, we study the integrated berth and crane scheduling problem in a tidal port with multiple terminals, considering the uncertainties, tides, maximum coverage of cranes and interference between cranes. For coping with the uncertainties, a certain number of randomly generated samples are used to evaluate the solutions, and slack variables are introduced to reduce the impact caused by the variation in vessel arrival and crane operational efficiency. A novel nonlinear mixed integer programming model is first formulated for the problem to minimize the sum of expectation and variance of costs under all samples. An improved adaptive genetic algorithm, combining a simulated annealing mechanism and greedy construction strategy, is developed and implemented by MATLAB. The feasibility and validity of the algorithm and the benefits of multi-terminal collaborative scheduling strategy under uncertainty are evaluated through numerical experiments. The results show that the algorithm can obtain feasible scheduling solutions with higher quality. Compared to the strategy that considers either the uncertainty or the multi-terminal collaborative mechanism, the resulting solution considering both can effectively reduce the cost and improve the competitiveness of the port.
Motivated by the need for a green and low-carbon economy, we explore the co-scheduling optimization of berths and cranes. Our aim is to balance the carbon tax and operating costs of ports under uncertain conditions, proposing an innovative nonlinear mixed-integer programming formulation. To address this optimization challenge, we have developed an enhanced version of the adaptive spiral flying dung beetle algorithm (ASFDBO). In order to evaluate the performance of the ASFDBO algorithm, we performed a benchmark function test and a convergence analysis with other recognized metaheuristics. In addition, we verified the practical applicability of the ASFDBO algorithm in different test scenarios. Through numerical experiments, we analyze the feasibility and effectiveness of the algorithm’s scheduling solutions and improvement strategies. Results indicate that our collaborative scheduling optimization, which considers both carbon and production costs, achieves feasible solutions and reduces carbon expenses. Finally, we investigate the impact of different carbon tax rates on the joint scheduling optimization of berths and quay cranes, and the results show that a reasonable carbon tax policy can effectively reduce the carbon emissions of ports.