Algorithm for Wagon Flow Group Number
Qian Ming-jun · Journal of Lanzhou Jiaotong University · 2010
To decide the train destination for each loaded wagon to belong to according to its unloading station is a fundamental task for technical stations.Based on the principles of data structure,a mathematic model is put forward to divide the railway network into destination sets for train formation according to the shortest wagon routing chain and the multi-branch tree structure with their leaves connected,and the model is soluted by thorough search method under the phase stop conditions.Finally,the methods to store the destination sets for train formation and the sketch map of destination sets are studied,which offers a way to access and apply the results.