Research On Slot Optimal Allocation Of Export Container In Container Terminal Under Uncertain Conditions

The past 30 years was the most rapid period in development of container transportation. The rapid development of global economic caused the container transportation developing, which spurred the development of container terminal, and area of terminal besides quantity of equipment are increasing as the throughout of container terminal is growing. The yard becomes the key zone gradually in terminal operation with the throughout of container in China broken through 100 million TEUs and uninterrupted development of container terminal construction. How to allocate and make use of the resource in yard becoming a more concerned question for terminal managers that influences operation efficiency and cost directly. And export container slot allocation becomes the key problem in optimal management of container terminal operation.The research focuses on the dynamic uncertainty of export container delivery time and proposes a two-level scheduling strategy which based on the analysis of the facts of export container stacking model. After that a two-layer planning model for the export container stacking problem is build, and then a solving algorithm based on tabu-searching is designed and achieved according to the requirement and characteristics of different stages of two-level scheduling strategy and model. Experiments show that the proposed method could make use of dynamic uncertain information efficiently to improve allocation effect and the algorithm could get the satisfied solution in reasonable time.After that the research focuses on the problem of slot optimization for export container in container yard under the uncertain condition of container delivery time. First, we analys the definite method of delivery sequence under the uncertain condition of container delivery time. And then we build a two-layer random planning model which optimizes bays allocation in the yard and stacks allocation in a bay that the optimal object is to minimize the distance of gantry crane and the reshuffling. We propoes a solving method of calculating reshuffling and moving length of granty crane under stochastic delivery sequence. Finally, according to the characteristics of model we develop the heuristic algorithm to solve it based on Tabu-search. Experiments show that the proposed method could make use of dynamic uncertain information of delivery sequence and improve allocation effect and the algorithm could get the satisfied solution in reasonable time.