In this paper, the disruption management problem of berth allocation is studied to deal with the unforeseen disruptions in container terminals. A berth allocation model considering the scheduling of quay crane is developed first. Then a disruption management model is developed to recover the berth schedule when unexpected events happen, and simulation optimization approach is proposed to solve the model. To improve the computation efficiency of simulation optimization approach, algorithms based on local rescheduling and tabu search is designed. Numerical experiments indicate that local rescheduling based algorithm can improve the computation efficiency comparing to full rescheduling based algorithm. Moreover, the disruption management model considers the benefit of different parties, thus increases the scientficity of recovery schedule. © 2011.
CITATION STYLE
Zeng, Q., Hu, X., Wang, W., & Fang, Y. (2011). Disruption management model and its algorithms for berth allocation problem in container terminals. International Journal of Innovative Computing, Information and Control, 7(5 B), 2763–2773.
Mendeley helps you to discover research relevant for your work.