期刊文献+

基于不同线搜索技术的改进Zoutendijk可行方向法及Matlab实现——浅谈在交通配流问题上的应用

Improved Zoutendijk Feasible Direction Method Based on Different Linear Search and Implementation in Matlab:Application in traffic assignment models
原文传递
导出
摘要 针对于求解带线性约束的非线性规划模型的Zoutendijk可行方向法在Matlab实现过程中的几个问题,提出了相应的改进方法及其Matlab实现,并将其应用于一类交通配流模型,得到了基于各种不同线搜索技术下的改进Zoutendijk可行方向法计算结果并进行了比较分析,发现非精确搜索下的改进Zoutendijk法更具有实用性. For several problems appearing in Matlab implementation of Zoutendijk feasible direction method of nonlinear programming model with linear constraints, we put forward an improved method and its implementation in Matlab, which is applied to a class of static traffic assignment model. Then the results are given based on the improved Zoutendijk feasible direction method under different linear search and compared. The results show that improved Zoutendijk feasible direction method under inexact linear search is more practical.
作者 刘建美
机构地区 济宁学院数学系
出处 《数学的实践与认识》 CSCD 北大核心 2014年第21期186-191,共6页 Mathematics in Practice and Theory
基金 国家自然科学基金(71401061) 济宁学院国家级基金计划预研项目(2012YYJJ04)
关键词 可行方向法 改进的Zoutendijk法 线搜索 MATLAB实现 交通配流 feasible direction method improved Zoutendijk method linear search Matlab implementation traffic assignment
  • 相关文献

参考文献16

  • 1Maher M J, and Hughes P C. A probit-based stochastic user equilibrium assignment model[J]. Transportation Research Part B, 1997, 31: 341-355.
  • 2Hillel Bar-Gera. Origin-Based Algorithm for the Traffic Assignment Problem[J]. Transportation Science, 2002, 36: 398-417.
  • 3Halim Ceylan and Michael G H. Bell. Genetic algorithm solution for the stochastic equilibrium transportation networks under congestion[J]. Transportation Research Part B, 2005, 39: 169-185.
  • 4Yang H, and Yagar S. Traffic assignment and signal control in saturated road networks[J]. Trans- portation Research A, 1995, 29(2): 125-139.
  • 5RB Dial. A Probabilistic Multipath Traffic Assignment Model Which obviates Path Enumeration[J]. Transportation Research, 1971, 5: 83-111.
  • 6Michael G H. Bell. Alternatives to Dial's logit assignment algorithm[J]. Transportation Research Part B, 1995, 29: 287-295.
  • 7Gunnarson S. An algorithm for multipath traffic assignment[D]. PTRC Urban Traffic Model Re- search Seminar, London, 1972.
  • 8Si B F, Zhong M, Zhang H Z and Jin W L. An improved Dials algorithm for logit-based traffic assignment within a directed acyclic network[J]. Transportation Planning and Technology, 2010, 33(2): 123-137.
  • 9Warren B. Powell, Yosef Sheffi. the Convergence of Equilibrium Algorithms with Predetermined Step Sizes[J]. Transportation Science, 1982, 16: 45-55.
  • 10Davis G A. Exact local solution of the continuous network design problem via stochastic user equilibrium assignment[J]. Transportation Research B,1993, 27: 61-75.

二级参考文献17

  • 1葛亮,王炜,杨明,邓卫.基于GIS的公交网络配流新方法[J].交通运输工程学报,2004,4(3):54-58. 被引量:6
  • 2王丰元,潘福全,张丽霞,邹旭东.基于交通限制的路网最优路径算法[J].交通运输工程学报,2005,5(1):92-95. 被引量:39
  • 3李军,辛松歆,蔡铭.基于拓扑处理的Logit型网络加载算法[J].中国公路学报,2005,18(4):87-90. 被引量:8
  • 4任刚,王炜.基于转向的Logit交通分配算法[J].交通运输工程学报,2005,5(4):101-105. 被引量:17
  • 5DIAl. R B. A Probabilistic Multipath Traffic Assignment Model Which Obviates Path Enumeration[J]. Transportation Research, 1971,5(2) :83-111.
  • 6BELL M G H. Alternatives to Dial's Logit Assignment Algorithm[J]. Transportation Research Part B, 1995,29(4) :287-295.
  • 7AKAMATSU T. Cyclic Flows, Markov Process and Stochastic Traffic Assignment[J]. Transportation Research Part B,1996,30(5) :369-386.
  • 8HUANG H J, BELL M G H. A Study on Logit Assignment Which Excludes All Cyclic Flows [J].Transportation Research Part B, 1998, 32 (6) : 401- 412.
  • 9SHEFFI Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods[M]. Englewood Cliffs : Prentice-hall, 1985.
  • 10何光宇.网络最优化算法的研究及其应用[D].北京:清华大学,1999.HE Guangyu. The Study on Network Programming and its Application [D]. Beijing: Tsinghua University, 1999.(in Chinese)

共引文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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