期刊文献+

可交易电子路票系统收费方案及价格算法设计 被引量:4

Designing Algorithm on Charging Scheme and Price of Tradable Travel Credits System
下载PDF
导出
摘要 可交易电子路票系统是交通需求管理的一种新方式,为缓解城市交通拥堵问题提供了新思路.本文对路票交易体系进行了两个重要的算法设计:路票收费方案的算法设计和路票价格的算法设计.根据用户均衡与系统最优原则之间的差别——边际成本,利用改进的牛顿算法设计每个路段需收取的路票数,并由路票守恒条件确定发行总量;通过外惩罚函数法求解既定路票收费方案下达到用户均衡状态的路票价格.最后将算法应用于算例路网中,说明合理的路票收费方案能有效缓解交通拥堵;比较路票价格与实际用户交易产生价格的差异,分析路票系统对缓解交通拥堵的效果. The tradable credits system is a new form of the transportation demand management, which provides a way to alleviate the urban traffic congestion problem. In order to solve the tradable credit problem,there were two algorithms proposed in this paper : one was designed to find the best price of the credit; the other was to solve the best credits charge of each link. According to the marginal cost between the user equilibrium and the system optimum,the credit charge amount of each link can be obtained as well as the total credit amount of the entire network. The extra penalty method was used to transfer the constrained problem to an unconstrained problem which can get the credit price. The conclusion showed that a rational credit charge policy can effectively alleviate the traffic congestion.
出处 《道路交通与安全》 2016年第6期6-13,共8页 Road Traffic & Safety
关键词 路票交易 用户均衡 系统最优 牛顿算法 外惩罚函数法 tradable travel credits user equilibrium system optimum newton algorithm exterior penalty function method
  • 相关文献

参考文献1

二级参考文献19

  • 1程琳,王炜,王京元,王欣.用户均衡网络中的敏感度分析方法[J].系统工程理论与实践,2004,24(11):116-121. 被引量:7
  • 2Heam D W, Ribera J. Bounded Flow Equilibrium Problems by Penalty Methods[R].Proceedings of the 1980 IEEE International Conference on Circuits and Computers, 1980. 162--166.
  • 3Inoue H. Traffic Equilibrium and Its Solution in Congested Road Networks[ C]. Proceedings of IFAC Control in Transportation Systems, 1986. 267--272.
  • 4Larsson T, Patriksson M. An augmented Lagrange dual algorithm for hnk capacity side constrained trafic assignment problems[J]. Transportation Research B, 1995, 29: 433--455.
  • 5Daganzo C F. On the traffic assignment problem with flow dependent costs[J]. Transportation Research, 1977, 11: 433--441.
  • 6Tobin R L, Friesz T L. Sensitivity analysis for equilibrium network flow[J]. Transportation Science, 1988, 22: 242--249.
  • 7Prashjer J N, Toledo. Adaptation of the Gradient Projection Algorithm for the Traffic Assignment Problem with Side Constraints[C]. Proceedings of the 80th Transportation Research Board (CD-ROM). 2000.
  • 8Cheng L, Lida Y, Uno N, et al. Alternative Quasi-Newton methods for capacitated UE assignment[J]. Transportation Research Record, 2003, 1857: 109---116.
  • 9Yu N, Zhang H M, Lee D H. Models and algorithms for the traffic assignment problem with link capacity constraints[J]. Transportation Research B, 2004, 38: 285--312.
  • 10Bertsekas D, Gallager. Data NetworksIM]. The 2nd edition. New Jersey: Printice-Hall, 1992. 365--478.

共引文献15

同被引文献36

引证文献4

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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