(189ad) A New Proactive Methodology for Robust Berth Planning of Container Vessels
AIChE Annual Meeting
2017
2017 Annual Meeting
Computing and Systems Technology Division
Interactive Session: Systems and Process Design
Monday, October 30, 2017 - 3:15pm to 4:45pm
Conventional berth allocation and planning models have difficulties to handle uncertainty of vessel arrival while constructing a nominal berth plan or nominal berth allocation. However, in reality, timetables become more and more vulnerable to disturbances. The delay of a single vessel might interrupt the entire schedule and make it very difficult or even impossible to recover. To deal with disturbances in transportation schedules, two approaches are getting more and more attention: (1) proactive robustness, which incorporates buffer times into strategic or tactical timetables to deal with disturbances and thus to prevent delay propagation through a well set schedule, and (2) reactive disruption management, which is concerned with operational recovery after a disruption. The research in this paper focuses on incorporating proactive robustness into the nominal berth planning.
Container vessels might arrive earlier or later than their nominal arrival time due to all kinds of uncertainties during port operations. Therefore, the customers and terminal operators agree upon an arrival window, which is placed around the nominal arrival time. The time interval between the nominal arrival and departure time is the nominal vessel process time. Existing publications are either focused on planning problem without considering realistic flexible arrival and departure time windows [1, 2], or using fixed maximal deviation from nominal arrival time that is still within the arrival window of vessels [3].
The problem is hence to develop a time window-based berth allocation planning model that minimizes the maximally required operation time for all scenarios where vessels arrive within their arrival time windows and depart within their departure time windows. The flexible arrival and departure time windows have been into account specifically as control variables. A robust mixed integer nonlinear programming (MINLP) model is developed, which explicitly incorporates the operation time agreements and minimizes the maximally required operation time. The general objective is to minimize the maximally required operation time while satisfy all the transportation demand and operation constrains. Commercial solvers such as BARON, DICOPT and ANTIGONE have been employed and compared to obtain the optimal solution of the developed MINLP planning model. Computational results of the case study demonstrate the efficacy of the developed planning model, and a significant reduction in the maximal operation time can be obtained.
References
1. Wang, F. and A. Lim, A stochastic beam search for the berth allocation problem. Decis. Support Syst., 2007. 42(4): p. 2186-2196.
2. Cordeau, J.-F., et al., Models and Tabu Search Heuristics for the Berth-Allocation Problem. Transportation Science, 2005. 39(4): p. 526-538.
3. Hendriks, M., et al., Robust cyclic berth planning of container vessels. OR Spectrum, 2010. 32(3): p. 501-517.