Yard Tony Allocation Based On Genetic Algorithm Optimization Problem

Container wharf is the special working place of harbor for loading and unloadingcontainers. Wharf is the joint between the transport of land way and waterway in the courseof container transport, and is the hinge of Multi-modal transport too. Container yard isseparated into marshalling yard and container yard, which its main effect is provided thetemporary place to store. Because the enterprises of container wharf have some notablecharacters such as succession, concurrent and disequilibrium, the management of containeryard is absolutely necessary so as to keep high throughputs and promise the quick efficiencyfor every ship of loaded and unloaded container.The management of field includes many aspects. It is mainly to optimize containerlocation in Bay and sequence of yard machines. This paper is study how to optimizecontainer location with the technology of mixed stack. When a weight-container arrives inthe yard on random, it is desire that setup arrangement times is minimum to consider thesituation to store and the degree of difficulty. Since the problem, is known to be aNP-hard one, it is very difficult that solve it by using traditional optimize methods. In thispaper, the author predigests the question in some degree and builds the model for theminimum of setup arrangement times. And then, it is improved to consider the difficultyof the yard's work. After it is given the special coding policy and the value of parameters,GA is chosen to solve it.Finally, the paper is presented the view of to optimize this question and next how toresearch many opinions.