期刊文献+

公交系统随机平衡网络设计模型及求解算法 被引量:4

A Stochastic Equilibrium Network Design Model and Its Solution Algorithm for Transit System
下载PDF
导出
摘要 本文根据公交网络的具体特点,对公交网络进行了系统的描述,提出 一个双层规划模型来描述随机平衡公交网络设计问题。在双层规划模型中,上层 模型为一个标准的公交网络设计模型,下层模型是一个公交网络随机平衡配流 模型。针对所提出的模型,设计了基于灵敏度分析的求解算法。最后,给出一 个简单算例加以证明。 According to transit network characteristics, transit network is systematically described in this paper. A bilevel programming model for transit network design problem is presented, in which the upper model is a normal transit network design mode l, and the lower model is a transit stochastic equilibrium assignment model. A heuristic solution algorithm based on sensitivity analysis is designed for the model proposed. Finally, a simple example is given to illustrate the application of the model and algorithm suggested.
出处 《中国管理科学》 CSSCI 2001年第1期41-49,共9页 Chinese Journal of Management Science
基金 国家自然科学基金资助项目!(19971002 79970014) 教育部跨世纪优秀人才培养计划项目
关键词 灵敏度分析 随机配流 启发式算法 频率优化 公交系统随机平衡网络 城市公交规划 双层规划模型 bilevel programming sensitivity analysis stochastic assignment heuristic algorithm frequency optimization.
  • 相关文献

参考文献10

  • 1[1]J. D Murchland Road network traffic distribution in equilibrium[J]. Operation Research-verfahren, 1970,8:145-183.
  • 2[2]J. De Cea and E. Fernandez. Transit assignment for congested public transport system: An equilibrium model[J]. Trans. Sci.,1993,27(2): 133-147.
  • 3[3]R. L. Tobin and T. L. Friesz. Sensitive analysis for equilibrium network flow[J]. Trans Sci, 1988,(4).
  • 4[4]G. Newell. Some issues relating to the optimal design of bus routes[J]. Trans. Sci., 13,20-35.
  • 5[5]A. Ceder and N. Wilson. Bus network design[J]. Trans. Res. B, 1986, 208(4): 331-334.
  • 6[6]A. Ceder. Bus frequency determination using passenger count data[J]. Trans. Res, 1994, 18A:516.
  • 7[7]L. LeBlanc. Transit system network design[J]. Trans. Res. B,1988, 22(5): 383-390.
  • 8[8]P. Furth and N. H. M Wilson. Setting frequency on bus routes: Theory and practice[J]. Transpn. Res., 1981, Record818:1-7.
  • 9[9]C. Fisk. Some developments in equilibrium traffic assignment[J]. Transpn. Res., 1980, 14B: 243-255.
  • 10[10]R. B.Dial. A probabilistic multipath traffic assignment algorithm which obviates path enumeration[J]. Transpn. Res., 1977, 5:83-111.

同被引文献25

  • 1刘海旭,蒲云.基于路段走行时间可靠性的路网容量可靠性[J].西南交通大学学报,2004,39(5):573-576. 被引量:19
  • 2童刚.遗传算法在公交调度中的应用研究[J].计算机工程,2005,31(13):29-31. 被引量:31
  • 3向联慧.[D].长沙:长沙铁道学院,2000.
  • 4王更生男.旅客运输[M].北京:中国铁道出版社,2003.117-120.
  • 5Michael G H B, Yasunori Lida. Transportation Network Analysis[M]. John Wiley & Sons,1997.153-163.
  • 6郭振宇.上海巴士公交信息化中的关键技术[D].上海交通大学硕士学位论文,2005.
  • 7C Z Jomikow, Z Michalewicz. An Experimental Comparison of Binary and Floating Point Representations in Genetic Mgorithm[ C]. In: Proc. Of 4^th Int. Conf. On Genetic Algorithms, 1991.31-36.
  • 8JorgeNocedal. Stephen J Wright. Numerical optimization [ M]. Berlin, Germany: Springer Science+Business Media Inc, 1999. 490-527.
  • 9Ceder R B,Wilson N H. Bus network design[J]. Trans- portation Research Part B, 1986, 20(4) :331-344.
  • 10Wei Fan. Optimal transit route network design prob- lem algorithms, implementations, and numerical re- sults[D]. Austin: The University of Texas at Aus- tin,2004.

引证文献4

二级引证文献51

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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