Abstract
In container terminals, the planned berth schedules often have to be revised because of disruptions caused by severe weather, equipment failures, technical problems and other unforeseen events. In this paper, the problem of berth schedule recovery is addressed to reduce the influences caused by disruptions. A multi-objective, multi-stage model is developed considering the characteristics of different customers and the trade-off of all parties involved. An approach based on the lexicographic optimization is designed to solve the model. Numerical experiments are provided to illustrate the validity of the proposed Model A and algorithms. Results indicate that the designed Model A and algorithm can tackle the berth plan recovery problem efficiently because the beneficial trade-off among all parties involved are considered. In addition, it is more flexible and feasible with the aspect of practical applications considering that the objective order can be adjusted by decision makers.
Highlights
Berths are important resource of container terminals and good scheduling of berths can improve operation efficiency, decrease the vessel turnaround time and lead to higher competitive of container terminals
This paper addresses the problem of berth schedule recovery based on disruption management methodology
–– A multi-stage and multi-objective model is proposed to minimize the negative impacts of disruptions on berth schedule
Summary
Berths are important resource of container terminals and good scheduling of berths can improve operation efficiency, decrease the vessel turnaround time and lead to higher competitive of container terminals. These events may cause tremendous disruption, and decrease the operation efficiency and service level of container terminals. Once these disruptions happen, the initial plan may be infeasible, and modification of current or future schedule should be undertaken to minimize the negative impacts of the disruption. Beneficial trade-off and customer characteristics should be considered when modelling the problem of berth schedule reco very. Berth schedule is an NP-hard problem (Kim, Moon 2003), and the characteristics of disruption management require the high speed and efficiency of solution algorithms. 2016, 31(1): 76–83 considering the characteristics of different customers and the benefit trade-off of all parties involved in the container terminal system.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
