Font Size: a A A

Research On Berth Allocation In Container Terminal Under Stocastic Environment

Posted on:2013-07-20Degree:MasterType:Thesis
Country:ChinaCandidate:X X WeiFull Text:PDF
GTID:2232330371497677Subject:Hydraulic engineering
Abstract/Summary:PDF Full Text Request
The container terminal is an important node in the international logistics system, whose operating efficiency has a direct impact on the efficiency of the world economy. The rapid development of the global economy has stimulated the development of container transport and then led the development of container terminal and the growing throughput of container terminal, so the past30years was the most flourishing period of the development of container transport. With the increase in demand of container terminal operations, the requirements for the wharf management of container terminal has gone up. The staff of the container terminal can make the berth allocation plan ahead according to the information of vessels arriving at port and the container volume.However, uncertain disruption events always happen in container terminal operations, like bad weather and mechanical failure, which may make the original plan failure of infeasible. Thurs, berth allocation problem under stocastic environment has become one of the key issues of operational optimization management in container terminal.When the impact which brought up by uncertain disruption events is small, the negative impact of the events can be eliminated by the robustness of the berth allocation plan under stocastic environment. Firstly, for the uncertainties of vessels’arriving time and processing time, this paper established a robust berth allocation model under stocastic environment. According to analyzing the complexity of solving berth allocation problem and the characteristics of the model, a rolling algorithm based on CPLEX was designed. When compared with the heuristic algorithm which was used by Zhang Haibin(2010), the experiment results show that the rolling algorithm based on CPLEX has a more satisfactory result within allowed consuming CPU time. Through simulation, it can be verified that guarantee rate under different vessle arrival intensities having different impact on the objective function. There exisits a best guarantee rate which can make the total dwelling time on port shorter.When the impact which brought up by uncertain disruption events is big, the original plan will become infeasible and a recovery scenario needs to work out. In the third part of this paper, a disruption recovery model was put forward. A re-scheduling method based on taboo search was used to solve the model and the simulation results show that this algorithm is able to obtain a satisfactory solution in a shorter period of time.
Keywords/Search Tags:Container terminal, Dynamic berth allocation, Stocastic mathematicalprogramming, CPLEX, Rolling-horizons algorithm, Dsruption anagement, Taboo searchalgorithm
PDF Full Text Request
Related items