Research On Income Distribution Model Of Metro Transferred Path

With the development of urban metro traffic constructions in our country, the coupling degree of routes becomes high. The transferring among different routes becomes frequent. Because different metro traffic routes may be managed by different companies, the manager's behalf be ensured by the fair distribution of the transferred income. Since Urban metro traffic routes in our country being constructed by stages, and many ways of the investment and management is exist. There is no similar circumstance in orther countries. Therefore,the creation of a model of the income distribution to ensure the fair division is very important in the development of the urban metro traffic in our country.The artificial account division model, Ideal income distribution model and shortest path income distribute model are existing. These models do not satisfy the development of metro traffic constructions.A new division model is proposed after deep research on Shanghai's metro traffic is presented. It keeps the balance between impartiality and practicability.At first, actual problem is changed to the path-searching problem in graph, and an algorithm named "Kth shortest path under single constraint with multiple weights" is proposed to solve the selection problem of the transferring path. In this algorithm, the mileages and stops of the transferred path are used as the main influence factors when passengers select a transferred path. Then the mathematical model of the income distribution by the above path searching algorithm is given. At last, the Shanghai's metro route is predigested as an instance, and the routes topology graph is abstracted to a undigraph. the income distribute proportion table is created automatically by using the new model. According to this table, the distribution system can be divided the transferring income into different investor or the managers to ensure their profits as fair as possible.Compare with three models mentioned above, the new model have three advantages:1. Constraint the number of transfer stration.2. Consideration K viable transferred path.3. Import selection probability.