期刊文献+

瞬时动态用户最优决策点逆序分配方法研究

Instantaneous Dynamic User Optimal Assignment in Reverse Order of Decision-nodes
下载PDF
导出
摘要 以基于瞬时路段阻抗的变分不等式模型的对角化算法为研究对象,指出若在一次迭代中完成所有时段的分配,其结果不能直接用于下一次迭代对应时段的流入率调整,对其产生的原因进行了分析,并根据瞬时动态用户最优网络的特性,阐述了时段可分离性和决策点可分离性,提出了基于时段推进的决策点逆序分配方法。结合与变分不等式模型等价的非线性规划模型,分析了该方法的原理并给出了逆序分配的步骤和示例。结果表明,该方法的核心是可用Frank-Wolfe算法求解的在各决策点上进行的各自紧后路段间的分配,决策点紧后路段之后的子路径最小瞬时阻抗的确定和一些决策点组合的同步分配都可以提高分配的速度。 The object was to solve the problem imbedding in Ren's diagonalization algorithm of variational inequality model based on instantaneous link travel times. The analysis showed that if the assignment was carried on for all time intervals at one iteration, the results could not be used in the inflow-rate adjustments at the next iteration. According to the separabilities of both time intervals and decision-nodes derived from the inherence of instantaneous dynamic user optimal network, an approach of assignment in reverse order of decision-nodes was proposed. The principle of this method was analyzed based on the equivalent non-linear programming of the variational inequality model. The results indicate that the kernel of the approach can be regarded as distributed assignment at each decision-node among its adjacent links by using Frank-Wolfe algorithm, and that the assignment speed can be improved
作者 李淑娟
机构地区 东南大学
出处 《交通与计算机》 2008年第4期23-27,共5页 Computer and Communications
基金 "十一五"国家科技支撑计划重点项目(批准号:2006BAJ18B01)资助
关键词 动态交通分配 决策点逆序分配 变分不等式模型 瞬时动态用户最优 时段可分离性 决策点可分离性 dynamic traffic assignment (DTA) assignment in reverse order of decision-nodes variational inequality (VI) model instantaneous dynamic user optimal (DUO) separability of time intervals separability of decision-nodes
  • 相关文献

参考文献5

二级参考文献14

  • 1Merchant D K, Nemhauser G L . A Model and an algorithm for the dynamic traffic assignment[J].Transportation Science, 1976b, 12, 62-77.
  • 2Friesz T L, Luque F J, Tobin R L, et al . Dynamic network traffic assignment considered as a continuous time optimal control problem[J]. Operations Research,1989, 37, 893-901.
  • 3Ran B, Boyce D E, LeBlanc L J . Anew class of instantaneous dynamic user-optimal traffic assignment models[J]. Operations Research, 1993, 41(1), 192-202.
  • 4Ran B, Boyce D E. Modeling Dynamic Transportation Network[M]. 1996, Springer.
  • 5Chen H K, Dynamic travel choice model--a variational inequality approach[M]. Springer, 1999.
  • 6Zhu D L, Marcotte P. On the existence of solutions to the dynamic user equilibrium problem[J] . Transportation Science, 2000, 34(4), 402-414.
  • 7Lam H K W,Huang H J. Dynamic user optimal traffic assignment model for many to one travel demand. Transportation Res. 1995(29):243.
  • 8Merchant D K,Nemhauser G L. A model and an algorithm for the dynamic traffic assignment problems/ Transportation Sci,1978(12):183.
  • 9Friesz T L,Luque F J,Tobin R L,et al. Dynamic network traffic assignment considered as acontinuous time optimal control problem. Operations Res,1989(37):893.
  • 10Ran B,Boyce D E,Le Blanc L J. A new calss of instantaneous dynamic user-optimal traffic assignment models. Operations Res,1993.91.

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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