The Optimization Of Resource In The Storage Yard Of Container Terminal

With the integration of economic in the world and the development of the globalization,the throughput of container is increasing year by year,which will put forward higher requirements to the construction,equipment and management in the port.However, the storage yard is the most complex part of the container terminal in the operation procedure.It can be said that the optimization of resources in the yard play an important role in the improving the overall efficiency of the port.This paper focus on the optimization of the space and equipment resources in the storage yard by combining with operation research,optimization theory and computer simulation,which includes the main contents as follows:The study has established a mixed integer model which is applied to the space allocation for export and import containers.The model aims to determine the storage bay for the arriving containers with the objective of minimizing the moving distance of trucks and balancing the workload of gantry cranes.Considering facilitating the practical operation of the yard,buffer zones are respectively established in the front and rear yard in order to accelerate the loading /unloading operation for vessels and improve the utilization of storage space.Finally,the model is sloved by lingo.The results show that the model not only realizes that the total moving distance of truck is the shortest but also guarantees the workload balance of gantry cranes.The study has established a dynamic programming model to determine the optimal storage slot in a yard-bay for an export container.In order to improve the satisfaction of the shipping, we make every stack abide by the principle that the time factor is prior to the weight one. Then we can respectively find the proper slots and store it into the yard-bay by the relocation movement of cranes.The objective is to minimize the total number of the relocation movement.In view that the time complexity is exponentially increasing with dynamic programming method, we adopt the genetic algorithm to resolve it and its results show that the algorithm not only finds the optimal solution but also decreases the time complexity.The study has established a mixed integer programming model about the scheduling of gantry cranes when large quantity of containers need to be transported to/from the yard as soon as possible.The model is to decide how to allocate the tasks to each crane and how to arrange for the cranes the servicing sequence with the objective of minimizing the total handling time and balancing the workload of cranes which considers the case of existing the precedence relations between tasks. The model can be reduced to the Multiple Traveling Salesman problem which is an NP-hard problem.Given the complexity of the problem,the genetic algorithm is utilized for solving.Then we compare its results with that of simulated annealing algorithm which show that the genetic algorithm is more suitable for solving.