Rail Transport Through The Algorithm-specific Research And Realization

With the enhancing of the freight amount in railway transport and theincreasing of the new route, the route choice and through path calculating hasbecome an important problem for the efficiency and benefit for the railwaytransport. If all the vehicle flow on the railway network transported in theshortest paths, will lead to exceed the transport capacity in some lines orsegments of the railway network because of the imbalance in vehicle flowdistributing. Therefore, in actual work some vehicle flow in the busy lines orsegments will be dispatched to another paths for transporting, this kind ofroute will be given by the documents which recording the specially designedpaths. How to construct those documents into standard rules and adjust theroute for railway transport according to the rules, while making sure theroutes which ajusted is the shortest routes relatively, all of these will be thefocus of this paper.This paper states the documents of the special transport route,thenintroduces the concept about the region of vehicle flow paths, the kinds andcomponents of the region of vehicle flow paths are also be discussed.Byapplying the Set Theory, and according to the documents of the speciallydesigned paths, the non-formalized documents of the special transport routeare converted into corresponding rules.The set of rules which belong to avehicle flow can be confirmed through comparing the information of thevehicle flow such as the start-end region, original routes and kind of the trainetc with the limiting conditions in the special transport route rules. In order topredigest the storage of the railway network and accelerate the speed ofcalculating, the paper reconstructs the railway network, and gives asecondary level model of railway network.The shortest paths calculatingbetween any points given can be realized through base points addeddynamicly. Optimized the Algorithm in calculating the shortest route in therailway network based on the Algorithm of Dijkstra. Via utilizing the formalthreshold as searching restrain, the searching on some off points can bepaused, whichwill make sure the searching mainly on the direction ofshortest route from the jumping-off point to the end point, this will eliminatesome useless process, saving the time on searching and raise the efficiency ofAlgorithm to calculate the shortest route. The research on the Algorithm of railway special transport route,realizing the confirmation of special transport route rules for the vehicle flowwhich start and end point are random given,then adjust the route according tothe rules while making sure the route will be relatively shortest afteradjusting.This Algorithm will support the route calculating in many kinds ofprocessing system, and will solve the calculating problem in traditionalvehicle flow route system, convenience the planning for the transport ofcargo, the planning of technique, the planning of organizing the trains intogroups, and the graphic design for the railway transport with efficiency andcorrectness.