A NETWORK OPTIMIZING METHOD FOR THE TRAINFORMATION PLAN
Shi Feng;Li Zhizhong;Sun Yan; Hu Jianhua(Research Dept.,Changsha Railway Institute,Changsha 410075)
In this paper,based on the given union wagon path ,the concept of the union trainformation plan is presented.A union train formation plan takes small amount datum,contains large amount information and makes operation fast.In addition,the parts of theunion train formation plan,where wagons have the same terminus,can be expressed by atree graph.The network flow model with fixed cost for train formation plan is described bymeans of concepts of the union wagon path and the union train formation plan. A heuristicmethod for the train formation plan is proposed.The method starts with the plan where the wagons are reformated at every station in their path,then adds or deletes some formatingdirections alternately,It is known that the train formation plan,given a group of formations,is similar to the wagon path,but the wagons’reformating transfer stations must be restricted in their own path.In this paper,the train formation plan,given a group of formations,without any constraint of marshalling capacity is transformed into ordinary shortest path problems where different shortest path problem has its different terminus.Hence,the train formation plan,given a group of formations, with the constraint of marshalling capacity can be transformed into a wagon path problem. The method can be usedto solve the train formation plan problem that is not very great. By the method,a good trainformation plan with 35 great marshalling yards in our railway network is found.
【CateGory Index】： U292.31