期刊文献+

城市轨道交通与驻站常规公交衔接调度优化研究 被引量:3

Study on Optimized Connection Scheduling Between Urban Rail and Bus System
下载PDF
导出
摘要 针对目前城市轨道交通与常规公交衔接难问题,本文从运营成本费用与出行者的出行费用最小化出发,对驻站常规公交协调发车间隔进行优化,建立城市轨道交通与驻站常规公交系统之间的衔接调度组合优化数学模型,并设计遗传模拟退火算法对该模型进行求解,通过多次仿真运算,结果分析表明该模型及算法的有效性和实用性。 This paper focuses on the difficult problem of connection scheduling between urban rail and bus system. Based on the minimum operation expense for operators and journey cost for passengers, the combinational optimization model of connection scheduling is established and solved with Genetic Simulated Annealing Algorithm. Through a couple of simulation operations, the results show that the model and algorithm are validity and usability.
出处 《城市公共交通》 2009年第11期30-34,共5页 Urban Public Transport
基金 甘肃省高等学校科研项目计划资助(0504-07) 兰州交通大学学生创新基金资助项目(DXS2008-017)
关键词 城市轨道交通 常规公交 衔接调度 模型 遗传模拟退火算法 Urban Rail System Bus System Connection Scheduling Model Genetic Simulated Annealing Algorithm
  • 相关文献

参考文献2

二级参考文献18

  • 1白子建,赵淑芝,田振中.公共交通网络优化的禁忌算法设计与实现[J].吉林大学学报(工学版),2006,36(3):340-344. 被引量:20
  • 2SAKAA A. Model for determing optimum bus-stop spacing in urban areas [ J]. Journal of transportation Engineering, 2001, 127(3) : 195 - 199.
  • 3JASZKIEWICZ A. On the Performance of multiple-objective genetic local search on the 0/1 knapsack problem: A comparative experiment[ J]. IEEE Transactions on Evolutionary Computation, 2002, 6(4):402 -412.
  • 4ELAOUD S, LOUKIL T, TEGHEM J. The pareto fitness genetic algorithm: Test function study[ J]. European Journal of Operational Research, 2007, 177(3) : 1703 - 1719.
  • 5ISHIBUCHI H, MURATA T A. Multi-objective genetic local search algorithm and its application to flowshop scheduling[ J]. IEEE Transactions on systems man and cybernetics part C: 1998, 28(3): 392 - 403.
  • 6GLOVER F. Tabu search: Part I[ J]. ORSA journal on Computing, 1989(1) : 190 -206.
  • 7GLOVER F. Tabu search II[ J]. ORSA Journal on Computing, 1989 (2) :4 -32.
  • 8Last A, Leak S E. Transept: a bus model [ J ]. Traffic Engineering and Control, 1976, 17: 14-20.
  • 9Current J, ReVelle C S, Cohon J L. The maximum covering/shortest path problem: a multi-objective network design and routing formulation[ J]. European Journal of Operational Research, 1985, 21 : 189-199.
  • 10William H K Lam, Zhou Jing, Sheng Zhao-han. A capacity restraint transit assignment with elastic line frequency[J]. Transportation Research Part B, 2002, 36 (10) : 919-938.

共引文献23

同被引文献9

引证文献3

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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