Study On Dynamic Dispatch Optimization Algorithm Of Railway Empty Container

The railway empty container dispatch is an important part of railway container transport market. But because of the illogicality of the current dispatch plan, the using ratio of the empty containers is evidently low. And the empty container dispatch cost also occupies the most part of the container manage cost. To solve the problem, a new transport plan model is needed, which can logically dispatch the empty containers, enhance the empty containers'using ratio and minish the empty containers'dispatch cost from station to station.Based on the study on the basic theory of the railway empty container dispatch problem, this paper constructs a multi-purpose math model on the empty container dispatch problem and proposes a resolve algorithm for this model. The first purpose is to enhance the empty containers'using ratio and the second purpose is to minish the empty containers'dispatch cost from station to station. The restrict condition is composed of the sending station's empty container restrict term, the receiving station's empty container restrict term, the restrict term of the transport capability, the non-minus restrict term and the integer restrict term. To resolve the problem, the key is how to resolve the decision variable. Based on the priority rating method, this paper resolves the problem using the genetic algorithm, by converting the muti-purpose function to a single-purpose function. Through the emulational experiment, this paper proves the multi-purpose model, which aims to resolve the empty containers'using ratio and the dispatch cost, can resolve the empty container dispatch problem efficiently by comparing the dispatch plans of this multi-purpose model and the traditional model.To resolve the transport scheme periodicity problem of the railway empty container dispatch, this paper improves the multi-purpose model by adding transport scheme fact and constructs a railway empty container dynamic dispatch model based on multi-purpose theory. Based on the multi-purpose model's resolve algorithm, this paper modifies the adaptation degree and converts the multi-purpose model's resolve algorithm to the dynamic dispatch model's resolve algorithm. Through the contrast experiment, by comparing the dynamic dispatch model'result with the traditional model'result and the experience dispatch's result, this paper shows that the dynamic dispatch model can enhance the using ratio of empty containers and minish the dispatch cost of the empty containers more optimizingly and resolve the railway empty container's dispatch problem in a transport scheme period effectively.