Computer Engineering and Applications ›› 2022, Vol. 58 ›› Issue (6): 241-249.

• Engineering and Applications •

### Joint Scheduling of Berths and Quay Cranes Considering Berth Preference and Quay Crane Movement

MEI Yiqun, HAN Xiaolong

1. Institute of Logistics Science and Engineering, Shanghai Maritime University, Shanghai 201306, China
• Online:2022-03-15 Published:2022-03-15

### 考虑泊位偏好和岸桥移动的泊位岸桥联合调度

1. 上海海事大学 物流科学与工程研究院，上海 201306

Abstract: To use the terminal resources more efficiently, this paper considers the berth resource and quay crane resource simultaneously, and establishes a two-stage model for joint scheduling of berths and quay cranes considering berth preference and quay-crane movement frequency. The first-stage model adopts the variable-in-time arrival strategy of the ship. A mixed-integer programming model is developed with the goal of minimizing the sum of ship waiting cost, deviation cost, and delay cost. The second-stage model considers interference constraints of the quay crane, and establishes an integer programming model with the minimum moving frequency of quay cranes. MATLAB is used to design an improved adaptive mutation particle swarm algorithm to solve the model. Compared with CPLEX and the original particle swarm algorithm, the proposed algorithm shows the high performance. In the two-stage model, a berth deviation factor[β]is introduced to express the indirect impact of berth deviation on the ship’s workload, and the impact of[β]changes on the ship’s working conditions is analyzed. It is found that under the circumstance of certain quay crane resources during the planned period, the deviation of the ship from the preferred berth will affect the total work cost, especially when the total work load of all ships is large, the increase of[β]will cause a sharp increase in the total cost. The results show that the model and algorithm are effective in solving the problem of berth-quay crane joint scheduling.