Railway Bills Audit System Mileage Calculations To Achieve The Research And The Realization

Finding out the shortest way between the two random stations rapidly and exactly always be a great concern for the railway company because it is the basis for the most common business. For example, it could be used to charge the interline freight and determine the ticket price. Nowadays this onerous work has been done by the computers and a lot of algorithms have been developed to solve the problem.But the algorithms using in the railways systems are somewhat inefficient and need to be improved. A new algorithm which could reduce the computing time and keep the exactness has great. The customer faces the question is the existing software is opposite in the computer technology rapid development gets too old.They has the necessity to have a new one to take place the existing one in order to make the operation more easier and we can see the result more directly.In this paper, the popular algorithms using in home and abroad have been thoroughly investigated and classified. The Dikstra algorithm is very exact comparing to the others. A new algorithm which combined the Dikstra algorithm and the network strategy is presented. Comparing with other algorithms, this algorithm is saving more time.The system to a ticket of current railroad pit in compute to the mileage of special request put forward to resolve the mileage computing to check the system mileage to compute the problem base on the web division with the algorithm of Dijkstra concrete to carry out the method, the distance that used for a ticket of railroad pit's checking the system mileage carry on computing the problem to solve and meets the customer's requiremen.