[1] Ren Gang, Wang Wei,. Direct computing methods for turn flows in traffic assignment [J]. Journal of Southeast University (English Edition), 2005, 21 (2): 225-228. [doi:10.3969/j.issn.1003-7985.2005.02.022]
Copy
Direct computing methods for turn flows in traffic assignment(
)
交通分配中转向流量的直接计算方法
)Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]
- Volumn:
- 21
- Issue:
- 2005 2
- Page:
- 225-228
- Research Field:
- Traffic and Transportation Engineering
- Publishing date:
- 2005-06-30
Info
- Title:
- Direct computing methods for turn flows in traffic assignment
- 交通分配中转向流量的直接计算方法
- Author(s):
- Ren Gang; Wang Wei
- College of Transportation, Southeast University, Nanjing 210096, China
- PACS:
- U491
- DOI:
- 10.3969/j.issn.1003-7985.2005.02.022
- Abstract:
- Two methods based on a slight modification of the regular traffic assignment algorithms are proposed to directly compute turn flows instead of estimating them from link flows or obtaining them by expanding the networks.The first one is designed on the path-turn incidence relationship, and it is similar to the computational procedure of link flows.It applies to the traffic assignment algorithms that can provide detailed path structures.The second utilizes the link-turn incidence relationship and the conservation of flow on links, a law deriving from this relationship.It is actually an improved version of Dial’s logit assignment algorithm.The proposed approaches can avoid the shortcomings both of the estimation methods, e.g.Furness’s model and Frator’s model, and of the network-expanding method in precision, stability and computation scale.Finally, they are validated by numerical examples.
- 为了在交通分配中直接得到转向流量而不是通过事后推算或网络扩展获取, 对常规的交通分配算法稍作修改后提出了转向流量的2种直接计算方法.第1种方法基于转向-路径关系, 其原理类似于路段流量的计算, 适用于给出具体路径构成的交通分配算法.第2种方法利用了转向-路段关系及其衍生的路段上流量守恒律, 是一种改进型Dial算法.这2种方法能避免传统的诸如Furness, Frator模型的事后推算法以及网络扩展法在精度、稳定性和计算量等方面的缺陷, 其有效性通过算例分别得到了验证.
References:
[1] Wang Wei, Xu Jiqian, Yang Tao, et al.Theories and applications of urban transportation planning [M].Nanjing:Southeast University Press, 1998.29-33.(in Chinese)
[2] Transportation Research Board.Highway capacity manual 2000 [R].Washington, DC:National Research Council, 2000.
[3] Yang B, Miller-Hooks E.Adaptive routing considering delays due to signal operations [J].Transportation Research, 2004, 38B(5):385-413.
[4] Wong S C, Yang Chao, Lo Hong K.A path-based traffic assignment algorithm based on the TRANSYT traffic model [J].Transportation Research, 2001, 35B(2):163-181.
[5] Clark S D, Watling D P.Sensitivity analysis of the probit-based stochastic user equilibrium assignment model [J].Transportation Research, 2002, 36B(1):617-635.
[6] Cheng L, Wang J Y, Shao Y H, et al.Choice probability problems in stochastic assignment [A].In:Mao B H, Tian Z Z, Sun Q X, eds.Proceedings of the 4th International Conference on Traffic and Transportation Studies [C].Beijing:Science Press, 2004.384-391.
[7] Bell M G H.Alternative to Dial’s logit assignment algorithm [J].Transportation Research, 1995, 29B(4):287-295.
[8] Akamatsu T.Cyclic flows, Marcov process and stochastic traffic assignment [J].Transportation Research, 1996, 30B(5):369-386.
[9] Sheffi Y.Urban Transportation networks:equilibrium analysis with mathematical programming methods [M].Englewood Cliffs:Prentice-Hall Inc, 1985.288-294.
Memo
- Memo:
- Biography: Ren Gang(1976—), male, doctor, lecturer, rengang@seu.edu.cn.