Solution of Three-Station Scattered Freight Loading Problem Based on Genetic Algorithm

In this paper, we analyze the condition of three-station scattered freight loading problem and use least wasting ton kilometer as object building up optimal model of this problem. Three-station scattered freight loading is a continuous assignment problem, the carrying capacity is wasted when we organize many-station scattered freight loading and middle stations have not freight be loaded. How to optimize the three-station scattered freight loading problem so that made carrying capacity wasting least is a worthy problem under the condition of railway wagons shortage and transportation capacity density. We obtain the solution according genetic algorithm; dispose the inefficacious solution according chromosome fitness and incidence matrices. Finally some experiments are performed to show the effectiveness of the models and algorithms. The results indicate that GA is effective to solve such problem.