期刊文献+

基于均衡载客量的公交时刻表优化方法研究

Research on Optimization of Bus Schedule Based on Balanced Passenger Loads
下载PDF
导出
摘要 本文首先介绍发车频率及发车间隔的确定方法,然后结合各公交站点在各时间段的平均观测客流量数据.以均衡载客量为原则.讨论了两种基于均衡载客量的公交时刻表编制方法:均衡最大载客断面载客量的时刻表编制方法与均衡单个车辆最大载客量的时刻表编制方法,并阐述了两种时刻表的编制流程。 The paper first introduces the method of determining the departure fi'equency and interval, discusses two methods of working out bus schedule based on the principle of balanced passengers load and real-time passenger flow volume of each station (one is to balance the maximum passenger flow section of whole line, another is to balance maximum passenger load of each bus) . At last, the paper elaborates the process of establishing the two kinds of schedule.
作者 许辉
出处 《城市公共交通》 2012年第2期27-30,33,共5页 Urban Public Transport
基金 北京市科委2010科技计划课题
关键词 均衡:载客量:公交时刻表 优化 Balanced Passenger Loads Bus Schedule Optimization
  • 相关文献

参考文献6

  • 1AvishaiCeder;关伟.公交交通规划与运营[M]北京:清华大学出版社,2010.
  • 2Newell,G.F. Dispatching policies for a transportation route[J].TransportationScience,1971,(05):91-105.
  • 3Hurdle,V.F. Minimum cost schedules for a public transportation route[J].TransportationScience,1973,(02):109-157.
  • 4Ceder,A,Stern,H.(I). Optimal transit timetables for a fixed vehicle fleet[A].UNU Science Press,1984.331-355.
  • 5刘志刚,申金升.区域公交时刻表及车辆调度双层规划模型[J].系统工程理论与实践,2007,27(11):135-141. 被引量:32
  • 6宋瑞,何世伟,杨永凯,杨海,罗康锦.公交时刻表设计与车辆运用综合优化模型[J].中国公路学报,2006,19(3):70-76. 被引量:14

二级参考文献20

  • 1王丰元,潘福全,张丽霞,邹旭东.基于交通限制的路网最优路径算法[J].交通运输工程学报,2005,5(1):92-95. 被引量:38
  • 2刘志刚,申金升,王海星,杨威.基于协同发车的区域公交时刻表生成模型研究[J].交通运输系统工程与信息,2007,7(2):109-113. 被引量:18
  • 3宋瑞.ITS运输管理模式与决策优化的研究[D].北京:北方交通大学,1999.
  • 4HICKMAN M D,BERNSTEIN D H.Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks[J].Transportation Science,1997,31(2):129-146.
  • 5NGUYEN S,PALLOTTINO S,MALUCELLI F.A Modeling Framework for Passenger Assignment on a Transport Network with Time Tables[J].Transportation Science,2001,35(3):238-249.
  • 6TONG C O,WONG S C.A Stochastic Transit Assignment Model Using a Dynamic Schedule-Based Network[J].Transportation Research,1999,33 (2):107-121.
  • 7BARNHART C,JOHNSON E L,NEMHAUSER G L,et al.Branch-Price:Column Generation for Solving Huge Integer Programs[J].Operations Research,1998,46(3):316-329.
  • 8VANDERBECK F.On Dantzig-Wolfe Decomposition in Integer Programming and Ways to Perform Branching in a Branch-and-Price Algorithm[J].Operations Research,2000,48 (1):111-128.
  • 9AHUJA R K,MAGNANTI T L,ORLIN J B.Network Flows,Theory,Algorithms and Applications[M].New Jersey:Prentice Hall,1993.
  • 10Haghani A, Banihasheml M. Heuristic approaches for solving large-scale bus transit vehicle scheduling problem with route time constraints [ J]. Transportation Research, 2002, 36A:309 - 333.

共引文献41

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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