Disruption management model and its algorithms for berth allocation problem in container terminals

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 scientificity of recovery schedule.

[1]  Akio Imai,et al.  Berth allocation with service priority , 2003 .

[2]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[3]  Akio Imai,et al.  The simultaneous berth and quay crane allocation problem , 2008 .

[4]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .

[5]  Xiangtong Qi,et al.  Disruption Management for Machine Scheduling , 2004 .

[6]  Qingcheng Zeng,et al.  Integrating simulation and optimization to schedule loading operations in container terminals , 2009, Comput. Oper. Res..

[7]  Xiangtong Qi,et al.  Coordination of supply chain after demand disruptions when retailers compete , 2007 .

[8]  Cameron G. Walker,et al.  Simultaneous disruption recovery of a train timetable and crew roster in real time , 2005, Comput. Oper. Res..

[9]  Youfang Huang,et al.  A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning , 2009, Comput. Ind. Eng..

[10]  Xuping Wang,et al.  ANALYSIS AND DESIGN OF DECISION SUPPORT SYSTEM OF DISRUPTION MANAGEMENT IN LOGISTICS SCHEDULING , 2009 .

[11]  Carlos F. Daganzo,et al.  THE CRANE SCHEDULING PROBLEM , 1989 .

[12]  Akio Imai,et al.  BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .

[13]  D. Petrovic,et al.  A fuzzy logic based production scheduling/rescheduling in the presence of uncertain disruptions , 2006, Fuzzy Sets Syst..

[14]  Xiangtong Qi,et al.  Disruption Management: Framework, Models And Applications , 2004 .

[15]  Cheng Wu,et al.  BOTTLENECK MACHINE IDENTIFICATION BASED ON OPTIMIZATION FOR THE JOB SHOP SCHEDULING PROBLEM , 2008 .

[16]  西村 悦子,et al.  Berth Allocation Planning in the Public Berth System by Genetic Algorithms , 2000 .

[17]  Lixin Miao,et al.  Quay crane scheduling with non-interference constraints in port container terminals , 2008 .

[18]  Kap Hwan Kim,et al.  A scheduling method for Berth and Quay cranes , 2003 .

[19]  Reza Tavakkoli-Moghaddam,et al.  An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports , 2009, Comput. Ind. Eng..

[20]  Akio Imai,et al.  Berth allocation at indented berths for mega-containerships , 2007, Eur. J. Oper. Res..

[21]  Andrew Lim,et al.  A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..

[22]  Christian Bierwirth,et al.  Heuristics for the integration of crane productivity in the berth allocation problem , 2009 .

[23]  Xiangtong Qi,et al.  Disruption management for machine scheduling: The case of SPT schedules , 2006 .

[24]  Anne Goodchild,et al.  Crane double cycling in container ports: Planning methods and evaluation , 2007 .