Research On Heuristic Method For Containers Yard Allocation Problem

In the past few years we have seen the improvement of free market and the globalization of the trade. The development makes the logistics and transportation more and more important, particularly in the marine transportation systems. As the part of the container terminal, terminal yard is a zone specially for storing containers, which plays a very important role in the whole container terminal operational logistics.This thesis, using the heuristic method, studies on the container terminal yard allocation problem.The main works are:Firstly, the paper expounded China's port status and container yard concept, function, operation procedures. Introduced a number of algorithms to solve the problem of yard space allocation, such as simulated annealing, genetic algorithms, tabu algorithms.Secondly, based on recursive algorithm, a yard approach to the yard space allocation, named DROP. The method for a group of container storage space request that have been given the priority sequence, recurrent allocation of space, to achieve the minimum use of space. Through the simulation experiments, the key to solve container yard space allocation problem is to find the optimal sequence space request.Thirdly, for how to find the optimal sequence, giving a critical request local neighborhood search method. The method uses a sort of time-based method to produce the initial sequence, and then searches for critical request, improves the quality of priority sequence by neighborhood local search method, eventually finds the optimal sequence. And the simulation experiments to verify the effectiveness of the approach.Finally, as search and development, analyzing the functions and structure of the yard scheduling information system, and how to use OpenGL technology.