期刊文献+

城市轨道交通系统运费清分方法研究 被引量:10

Modeling Income Distribution of the Auto Fare Collection System
下载PDF
导出
摘要 为了适应经济发展,我国许多城市加快了轨道交通的建设步伐.私营公司与政府签订合作协议,共同参与运营管理,这打破了以往一家运营商的垄断局面.如何在保证高质量的运营效率的同时,兼顾各家运营商的收益分配,运费清分的研究显得十分重要.分析了影响清分的主要因素和原则,建立有效路径选择模型和基于概率的多路径选择模型.采用改进的遍历算法以保证有效路径集的完整性.利用c++程序计算出各条路径的分担比例和各家运营商的清分比例,给出了提高清分比例的研究结论和建议. To be seasoned with the need of city development, many cities are accelerating the construction of rail traffic network. Private corporations have signed public-private-partnership protocols with the government, which means that the management authorities have changed from one to more. At the same time, how to ensure the benefits of different operation companies, to maintain high operational quality of the rail traffic network and to draw reasonable agreements of income distribution have become very important. This paper analyzes the influencing facts and principles of income distribution, builds models to find the available routes and creates the multi-route choice model based on probability. Besides, it revises the algorithm to guarantee the integrity of routes set and estimates the parameters by rail traffic investigation. The paper has developed a c + + program to search the available routes and done the calculation of income distribution percentage. It carries out sensitivity analysis of different facts to make sure the influence degree on route choice behavior of passengers. Finally it presents the suggestion to operation companies on how to improve the performance.
出处 《交通运输系统工程与信息》 EI CSCD 2007年第6期85-90,共6页 Journal of Transportation Systems Engineering and Information Technology
关键词 城市轨道交通 自动售检票 运费清分 数学模型 urban rail transit auto fare collection income distribution mathematical models
  • 相关文献

参考文献4

二级参考文献8

  • 1张忠诚.两种情形下参数的极大似然估计[J].高等函授学报(自然科学版),2005,18(1):27-28. 被引量:5
  • 2[美]斯皮格尔 孙山 戴中维.概率与统计[M].北京:科学出版社,2002..
  • 3http://metro.myrice.com
  • 4E.W. Dijkstra. A note on problem in connexion with graphs [J].Numeric Mathematics. 1959(1):269~271
  • 5John Hershberger, Matthew Maxel and Subhash Suri. Finding the K shortest simple paths:A new algorithm and its implementation[R].ALENEX 2003(1):11~14 Baltimore.
  • 6Dial R B. A Probabilistic Multipath Traffic Assignment Model Which obviates Path Enumeration[J]. Transportation Research, 1971, (5) :83 - 111.
  • 7黄海军.城市交通平衡网络分析理论与实践[M].北京:人民交通出版社,1994.
  • 8杜海宁,张毅,宋靖雁.基于树状结构的高速公路路网扩展及收费清分实现[J].公路交通科技,2002,19(3):102-105. 被引量:17

共引文献28

同被引文献35

引证文献10

二级引证文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部