Details

Autor(en) / Beteiligte

• Jia, Li
• Lei, Dingyou
• Zhang, Yinggui
• Zeng, Qiongfang
• Wang, Juan

Titel

The model and algorithm of distributing cooperation profits among operators of urban rail transit under PPP pattern

Ist Teil von

• Cluster computing, 2017-12, Vol.20 (4), p.3023-3036

Ort / Verlag

New York: Springer US

Erscheinungsjahr

2017

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• The financing channels, investors and operators of urban rail transit are becoming more and more diversified, and public private partnership pattern has been increasingly suggested in financing and investment field of urban rail transit in China. The diversification of investors of urban rail transit will no doubt lead to the diversification of operators of urban rail transit network. To legitimately distribute the cooperation profits among operators, a model is developed based on passenger’s path choice behavior by considering travel period, travel time, transfer convenience and the comprehensive proportion of different service types provided by operators. In accordance with the features of urban rail transit network and origin-destination (OD) pairs of transferring among lines of different operators, a scheme of improved rail transit network is proposed. On the basis of the algorithm of breadth-first search and depth-first search, an algorithm of searching effective paths based on backtracking and traversing along the shortest path is established by considering the factor of transfer. Taking the example of Shenzhen’s rail transit network, three typical OD pairs are selected to measure and calculate, compare and analyze by six different conditions. The result shows that travel period, travel time, transfer convenience, and service types provided by operators exert great influence on the distribution of cooperation profits. Therefore, it is advisable to comprehensively consider all of these factors to improve the accuracy of cooperation profits distribution. Moreover, the proposed algorithm can search effective paths efficiently.