期刊文献+

基于Frank-Wolfe算法的交通分配研究

Research on Traffic Assignment Based on Frank-Wolfe Algorithm
在线阅读 下载PDF
导出
摘要 为了提升交通分配算法的速度以适应现实业务需求。本文提出了一种改进Frank-Wolfe算法,该算法模型相较于传统模型,优化了道路路阻计算方法,使模型路径规划接近现实情况,并预设出行路径集,避免穷举网络所有路径。此外,本文还解决了路段途径车流OD无法溯源的问题。在测试实验中,本文以深圳市的交通数据为实验数据,用本文的方法进行OD溯源和交通分配,本文中的算法在运行速度上明显优于传统算法,更有利于部署在城市交通管理实际应用上。 In order to improve the speed of the traffic allocation algorithm to adapt to the actual business needs,this paper proposes an improved Frank-Wolfe algorithm.Compared with the traditional model,the algorithm model optimizes the road resistance calculation method,makes the model path planning close to the reality,and presets the travel path set to avoid exhausting all paths in the network.In addition,this paper also solves the problem that the OD of the traffic flow on the road section cannot be traced to the source.In the test experiment,this paper uses the traffic data of Shenzhen as the experimental data,and uses the method of this paper to carry out OD traceability and traffic distribution.The algorithm in this paper is significantly better than traditional algorithms in operating speed,and is more conducive to deployment in urban traffic management application.
作者 郑晏群 张鹍鹏 ZHENG Yan-qun;ZHANG Kun-peng(Shenzhen Transportation Operation Command Center,Shenzhen 518040,China;Shenzhen Transportation Design&Research Institute,Shenzhen 518003,China)
出处 《价值工程》 2021年第14期193-196,共4页 Value Engineering
关键词 交通分配 Frank-Wolfe算法 OD溯源 traffic assignment Frank-Wolfe algorithm OD traceability
作者简介 郑晏群(1984-),女,山东临沂人,高级工程师(交通信息工程及控制),硕士研究生,研究方向为智能交通;张鹍鹏(1981-),男,河南鹤壁人,教授级高级工程师(交通信息工程及控制),博士研究生,研究方向为智能交通。
  • 相关文献

参考文献9

二级参考文献55

  • 1王炜.多路径交通分配模型的改进及节点分配算法[J].东南大学学报(自然科学版),1994,24(6):21-26. 被引量:18
  • 2杜学东,四兵峰.基于随机均衡配流的O-D量估计双层规划模型及算法[J].山东科技大学学报(自然科学版),2005,24(3):86-89. 被引量:1
  • 3黄海军,李志纯.组合出行方式下的混合均衡分配模型及求解算法[J].系统科学与数学,2006,26(3):352-361. 被引量:28
  • 4张国强,陆键.连续网络设计问题的遗传算法[J].交通运输系统工程与信息,2007,7(1):101-105. 被引量:4
  • 5Claudine Sproles.Trends in sustainable development[J].Government Information Quarterly,2008,25(2):337-338.
  • 6Chiou S W.Bilevel programming for the continuous transport network design[J].Transportation Research Part B,2005,39:361-383.
  • 7Jeff X,Ban,Henry X,et al.A general MPCC model and its solution algorithm for continuous network design problem[J].Mathematical and Computer Modelling,2006,43(5-6):493-505.
  • 8Tianze Xu,Heng Wei,Zhuan-De Wang.Study on continuous network design problem using simulated annealing and genetic algorithm[J].Expert Systems with Applications,2009,36(2):2735-2741.
  • 9Hossain Poorzahedy,Mark A Turnquist.Approximate algorithms for the discrete network design problem[J].Transportation Research Part B,1982,16(1):45-55.
  • 10Gao Z Y,Wu J J,Sun H J.Solution algorithm for the bi-level discrete network design problem[J].Transportation Research Part B,2005,39:479-495.

共引文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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