Research On Container Terminals Yard Block And Slot Allocation In A Mixed Stacking Way

As one of the main transportation means of multinational / regional trade, container transport plays an increasingly important role in the world of modern logistics. Container terminal is the hub of container transport system, which uses its space resources (berths, container yard, warehouses, anchorage) and equipment resources (loading and unloading equipments, transportation equipments, etc.) to do the loading,unloading and transport container cargo operations. The container yard as a place for stacking, storage and transit containers, is the most important container terminal space resources. In recent years, while the growing global trade in goods, the container ports by the physical conditions of space resources, limited by factors such as urban development are difficult to increase substantially. Facing the growing port cargo throughput in recent years, major ports are dedicated to use the scientific management of the yard operations and optimization, study how to rational use of limited space resources--container yard to improve the operating efficiency of the container terminal.In order to improve space resources utilization and operational efficiency of the container yard, space allocation problem in yard block were studied firstly. Considering the work balance of blocks area and reduce the amount of work time for the two ships stranded in the port of overall service quality factors. According to the characteristics of the container yard operation problem, a integer programming model is established。In this model, we grouped the containers according to their properties, and considered both ship and client ends of the yard,also the import and export two types of containers are included. To solve this model, two heuristic algorithms are designed. Finally, numerical experiments are made by examples to analyze the results and efficiency of the algorithm, and draw relevant conclusions.Based on the research of the above problem, the mixed staking way of slot allocation problem were studied under certainty environment. An integer programming model is established within single block and in mixed container stacking way. In this model, time windows of the yard cranes'loading and unloading operation, sequence dependent setup time etc. constraints, are considered. An improved tabu search algorithm is designed to solve the problem. Finally, numerical experiments show that the improved tabu search algorithm are efficient, especially in large-scale problem.Arrival time uncertainty of import container are considered in the study of slot allocation problem。Analysis the uncertainty of issues related , and give a quantitative description of the arrival time distribution of imported container。Established a simulation model and designed simulation-based dynamic scheduling scheme to solve the model. Numerical simulation experiment was designed to compare the static scheduling and dynamic scheduling methods, numerical results show that the dynamic scheduling method is better than static scheduling.