Integrating Optimization of Berth Allocation and Quay Crane Assignment Decision Under Uncertain Situation

Zhe Wang

《International Core Journal of Engineering》 6卷10期 (2020/10) Pp. 123-139

https://doi.org/10.6919/ICJE.202010_6(10).0020

摘要

It is very important to jointly determine effective berth and quay crane allocation plan in order to make full use of the limited berth and quay crane resource and improve container terminal transportation efficiency. The uncertainty of ship's arrival time and the quantity of loading and unloading, however, will disrupt the execution of the berth and quay crane allocation plan and increase the cost. In order to minimize the total cost of time and position deviation, the optimal model of berth and quay crane allocation is proposed. The combination of SWO algorithm and PGA algorithm is presented to solve the optimization model, because SWO algorithm can effectively reduce the dimension of the solution and can avoid the PGA algorithm to converge to the local optimal solution. The correctness of the model and the validity of the algorithm are verified by numerical analysis.

關鍵字

Berth and Quay Crane allocation plan ； SWO algorithm ； Hybrid Heuristic algorithm

參考文獻

Park. Y M, Kim. K H. A scheduling method for berth and quay cranes. OR Spectrum 25 (2003), 1–23.

Cordeau. J F, Laporte. G, Legato. P, Moccia. L. Models and Tabu Search heuristics for the berth-allocation problem. Transportation Science. 2005, 39 (4),526–538.

Hansen. P, Oguz. C, Mladenovic. N, in press. Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research.

Meisel. F, Bierwirth. C. Integration of berth allocation and crane assignment to improve the resource utilization at a seaport container terminal. In: Haasis, H.-D., Kopfer, H., Schonberger, J. (Eds.), Operations Research Proceedings 2005. Springer, Berlin, 2006, pp. 105–110.

Xu. Y, Chen. Q, Quan. X. Robust berth scheduling with uncertain vessel delay and handling time. Ann Oper Res DOI 10.1007/s10479-010-0820-0, 2011.