[1] Zhao Jinbao, Deng Wei,. Lazy loading algorithm for traffic assignment of road networksunder fixed charge condition [J]. Journal of Southeast University (English Edition), 2011, 27 (2): 185-187. [doi:10.3969/j.issn.1003-7985.2011.02.014]
Copy
Lazy loading algorithm for traffic assignment of road networksunder fixed charge condition(
)
固定收费路网条件下交通分配的延迟加载算法
)Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]
- Volumn:
- 27
- Issue:
- 2011 2
- Page:
- 185-187
- Research Field:
- Traffic and Transportation Engineering
- Publishing date:
- 2011-06-30
Info
- Title:
- Lazy loading algorithm for traffic assignment of road networksunder fixed charge condition
- 固定收费路网条件下交通分配的延迟加载算法
- Author(s):
- Zhao Jinbao, Deng Wei
- School of Transportation, Southeast University, Nanjing 210096, China
- PACS:
- U491.2
- DOI:
- 10.3969/j.issn.1003-7985.2011.02.014
- Abstract:
- The measures of path charge are important considerations in traffic assignment of road networks. Factors, such as travel time, fixed charge and traffic congestion which affect road users’ choices of trip paths, are analyzed. Travelers usually decide their trip paths based on their personal habits, preferences and the information at hand. By considering both deterministic and stochastic factors which affect the value of time(VOT)during the process of path choosing, a variational inequality model is proposed to describe the problem of traffic assignment. A lazy loading algorithm for traffic assignment is designed to solve the proposed model, and the calculation steps are given. Numerical experiment results show that compared with the all-or-nothing assignment, the proposed model and the algorithm can provide more optimal traffic assignments for road networks. The results of this study can be used to optimize traffic planning and management.
- 路径收费措施是影响道路网络交通分配的重要因素.受出行时间、道路收费及交通拥堵等多种因素的影响, 道路使用者会根据自身习惯、偏好及掌握的信息选择不同的出行路径.综合考虑了路径选择过程中确定性因素和随机性因素对时间感知价值的影响, 建立了交通分配的变分不等式模型, 设计了求解该模型的延迟加载算法, 并叙述了该算法的求解过程.算例结果表明:相对于全有全无交通分配, 该模型和算法可以对道路网络中的交通流量进行更优化的分配.分析研究结果可以为实际的交通网络规划与管理提供借鉴.
References:
[1] Nie Y, Zhang H M, Lee Der-Horng. Models and algorithms for the traffic assignment problem with link capacity constraints[J]. Transportation Research Part B, 2004, 38(4):285-312.
[2] Lam W H K, Yin Y F. An activity-based time-dependent traffic assignment model[J]. Transportation Research Part B, 2001, 35(6):549-574.
[3] Yu X J, Huang H J, Liu T L. Efficiency loss of the multiclass stochastic traffic equilibrium assignment with fixed demand[J]. Journal of Transportation Systems Engineering and Information Technology, 2009, 9(4):83-89.
[4] Beckmann M J, Mcguire C B, Winsten C B. Studies in the economics of transportation[M]. Yale University Press, 1956:84-96.
[5] Smith M J. Existence, uniqueness and stability of traffic equilibria[J]. Transportation Research Part B, 1979, 13(2):295-304.
[6] Maher M J, Hughes P C. A probit-based stochastic user equilibrium assignment model[J]. Transportation Research Part B, 1997, 31(4):341-355.
[7] Sheffi Y. Urban transportation networks: equilibrium analysis with mathematical programming methods[M]. Englewood Cliffs, NJ, USA: Prentice-Hall, 1985:156-179.
[8] Gabriel S A. Bernstein D. The traffic equilibrium problem with nonadditive path costs[J]. Transportation Science, 1997, 31(4):337-348.
[9] Larsson T, Lindberg P O, Lundgren J, et al. On traffic equilibrium models with a nonlinear time/money relation[M]. Boston, MA, USA:Kluwer Academic Publishers, 2002.
Memo
- Memo:
-
Biographies: Zhao Jinbao(1987—), male, graduate; Deng Wei(corresponding author), male, doctor, professor, dengwei@seu.edu.cn.
Foundation items: The National High Technology Research and Development Program of China(863 Program)(No.2007AA11Z202), the National Key Technology R&D Program of China during the 11th Five-Year Plan Period(No.2006BAJ18B03).
Citation: Zhao Jinbao, Deng Wei.Lazy loading algorithm for traffic assignment of road networks under fixed charge condition[J].Journal of Southeast University(English Edition), 2011, 27(2):185-187.[doi:10.3969/j.issn.1003-7985.2011.02.014]