A Research Of Dynamic Continuous Berth Allocation Problem In Container Terminal

Berths of container terminals are scarce resources, how to use the berth reasonably, shorten ships’ handling-time in port, lower production costs, so as to improve the quality of service and its competitiveness of the terminal, is the most fundamental to the survival and development of the terminal. In view of the berth scheduling problem, this paper systematically summarized and reviewed the related literature, found the studies of continuous berth allocation problem are still not ideal, therefore, continuous berth allocation problem also need to be further improved and perfected.In this paper, the problem we study is continuous berth allocation problem in container ports and belongs to a single link scheduling optimization problem. There are two typical berth allocation problems: discrete berth allocation and continuous berth allocation. The advantage of the former is that it can easily arrange the berth allocation plan but cannot effectively use coastline, while the latter has the opposite characteristics. Given the growth of the containership’s tonnage, hub ports with a variety of ships called need more flexible berth allocation plans. This paper assumes that the handling time and the scheduling cost of trucks depend on the berthing location and the target is to minimize the total service cost of ships. We use the tabu search algorithm to solve the container terminal continuous dynamic berth allocation problem. We carried on experiments, proving that the tabu search algorithm has a good effect to solve this problem. The use of container terminal simulation software FlexTerm dynamic continuous berth allocation of container terminals in the simulation analysis, prove the validity and reliability of the algorithm, and on this basis has been further optimized.