期刊文献+

考虑实时需求的定制公交在线调度算法研究

Research on Customized Bus Online Scheduling Algorithm Considering Real-time Demand
下载PDF
导出
摘要 大城市居民多样性的出行需求以及互联网的普及和发展,定制公交等新型公共交通服务有望成为未来城市的主流交通方式。论文考虑实时出行需求下的定制公交调度问题。首先运用在线理论与方法,建立模型并设计在线算法;然后分析当乘客发出订单时,定制公交在不同情况下的在线调度方案,并计算出其竞争比,说明竞争算法适用于定制公交调度问题;最后,以重庆市475路公交线路为例,验证该算法的可行性和有效性。结果表明,在线问题与竞争策略的理论与方法适用于定制公交在线调度问题。 Due to the diverse travel needs of urban residents and the popularity and development of the Internet,customized public transport and other new public transport services are expected to become the mainstream mode of urban transport in the future.This paper considers the customized bus scheduling problem with real-time travel demand.Firstly,the online theory and method are used to establish the model and design the online algorithm.Then,the online scheduling scheme of customized bus under different conditions is analyzed when the passenger sends out the order,and its competitive ratio is calculated,which shows that the competitive algorithm is suitable for customized bus scheduling problem.Finally,the feasibility and effectiveness of the algorithm are verified by taking Chongqing 475 bus line as an example.The results indicate that the theories and methods of online problems and competitive strategies are applicable to customized bus online scheduling problem.
作者 陈程 石超峰 熊敏 CHEN Cheng;SHI Chaofeng;XIONG Min(College of Traffic and Transportation,Chongqing Jiaotong University,Chongqing 400074;College of Economics and Management,Chongqing Jiaotong University,Chongqing 400074)
出处 《计算机与数字工程》 2024年第9期2555-2560,2582,共7页 Computer & Digital Engineering
基金 国家社会科学基金项目(编号:16BJL121) 重庆交通大学科研启动经费项目(编号:17JDKJC-A002) 重庆市教委科学技术研究项目(编号:KJ1705148)资助。
关键词 定制公交 在线调度 在线算法 竞争比 customized bus online scheduling online algorithm competition ratio
  • 相关文献

参考文献6

二级参考文献30

  • 1李仁安,袁际军.基于改进遗传算法的物流配送路线优化研究[J].武汉理工大学学报,2004,26(12):99-101. 被引量:18
  • 2Ausiello G, Feuerstein E, Leonardi S, et al. competitive algorithms for the traveling salesman[ A]. In: Proceedings of the 4th Workshop on Algorithm and Data Structures (WADS'95), Lecture Notes in Computer Science[ C]. Berlin: Springer 1995, 955:206-217.
  • 3Ausiello G, Leonardi S, Spaccamela A M. On salesmen, repairmen and other travelling agents[ A]. In: Invited Paper to the 4th Italian Conference on Algorithms and Complexity (CIAC '00), LNCS[ C ]. Berlin: Springer, 2000, 1767: 1-16.
  • 4Sleator D D, Tarjan R E. Amortized efficiency of list update and paging rules[J]. Communications of the ACM, 1985, 28: 202-208.
  • 5Ma W M, Xu Y F, You J, et al. New result on the k-truck scheduling problem[ A]. In: The Eighth Annual International Computing and Combinatorics Conference (COCOON'02)[ C]. Singapore: Lecture Notes in Computer Science, 2002, 2387: 504-513.
  • 6Ma W M, Xu Y F, Wang K L. k-truck problem and its competitive algorithms[J]. Journal of Global Optimization, 2001, 21 (1):15-25.
  • 7Ascheuer N, Krumke S O, Rambau J. Online dial-a-ride problems: Minimizing the completion time[A]. In: Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, Vol 1770 of Lecture Notes in Computer Science[ C].Berlin: Springer, 2000, 639-650.
  • 8Ascheuer N, Grotschel M, Krumke S O, et al. Combinatorial online optimization[ A]. In: Proceedings of the International Conference of Operations Research (OR'98)[ C]. Zurich: Springer, 1998. 21-27.
  • 9Ausiello G, Feuerstein E, Leenardi S, et al. serving request with on-line routing[A]. In: Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), Lecture Notes in Computer Science[ C]. Berlin: Springer, 1994, 824: 37-48.
  • 10孙杨,宋瑞,何世伟.弹性需求下的接运公交网络设计[J].吉林大学学报(工学版),2011,41(2):349-354. 被引量:13

共引文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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