计算机科学 ›› 2017, Vol. 44 ›› Issue (10): 269-275.doi: 10.11896/j.issn.1002-137X.2017.10.049
王洋,沈记全
WANG Yang and SHEN Ji-quan
摘要: 针对目前全程车和大站快车的单线公交组合调度模型中对乘客的分类及滞站乘客乘车处理方法的不足,分3个步骤对模型进行了补充:首先,系统地探讨了乘客的构成及转化关系,并基于滞站乘客等车数、滞站原因及目的站距离提出一种处理滞站乘客乘车的方法,并以此方法计算滞站乘客等车的时间成本;其次,通过发车车型、模式和间隔的变量组合构建发车时刻表,进而以此表的信息为基础推算运营时刻表的各项变量,从而计算出公交服务各项指标及乘客和车辆的相关成本;最后,根据问题特征,应用最大最小蚁群系统算法求解模型。结合实例,对比分析了给定配车数和限定时间段内4种调度策略的发车时刻表最优解及相应最优解的公交服务指标和相关成本。实验结果表明,采用间隔不定的组合调度策略能够使车辆均衡分配站点客流,最大限度地降低乘客的时间成本及车辆耗燃成本。
[1] WEI M,CHEN X W,SUN B.Multi-objective Single Line Transit Mixed Scheduling Model Considering Express Bus Service[J].Journal of Transportation Systems Engineering and Information Technology,2015,5(2):169-181.(in Chinese) 魏明,陈学武,孙博.配合大站快车的单线公交组合调度模型[J].交通运输系统工程与信息,2015,5(2):169-181. [2] MING J,ZHANG G J,LIU Y D.Combinatorial OptimizationModel of Multi-model Transit Scheduling[J].Computer Science,2015,2(9):263-267.(in Chinese) 明洁,张贵军,刘玉栋.多模式公交组合调度优化模型[J].计算机科学,2015,2(9):263-267. [3] CEDER A.Designing Transit Short-Turn Trips with the Elimination of Imbalanced Loads[M].Computer-Aided Transit Scheduling,1988:321-326. [4] AICHONG S,MARK H.The Real-Time Stop-skipping Problem[J].Journal of Intelligent Transportation Systems,2005,9(2):91-109. [5] MEKKAOUI O,DE PALMA A,Lindscy R,et al.Optional bus timetables and trip timing preferences[C]∥The 8th International Conference on Computer aided Scheduling of Public Transport.2000:356-364. [6] 杨兆升.城市智能公共交通系统理论与方法[M].北京:中国铁道出版社,2004. [7] WU L R.Real-time Tour Planning for Flexible Route Bus Considering Passengers’ Waiting Behavior[D].Dalian:Dalian University of Technology,2014.(in Chinese) 吴丽荣.考虑乘客等待行为的柔性路径公交车实时调度方法[D].大连:大连理工大学,2014. [8] NIU X Q,CHEN Q,WANG W.Optimal model of urban busfrequency determination[J].Journal of Traffic and Transportation Engineering,2003,3(4):68-72.(in Chinese) 牛学勤,陈茜,王炜.城市公交线路调度发车频率优化模型[J].交通运输工程学报,2003,3(4):68-72. [9] 余志生.汽车理论[M].北京:机械工业出版社,2009. [10] TIAN R,SUN L F.Multi-unloading Packing Problem ModelResearch Based on MMAS[J].Journal of Chongqing Jiaotong University(Natural Science Edition),2016,5(2):156-162.(in Chinese) 田冉,孙林夫.基于最大最小蚁群算法的多卸载点车载装箱模型研究[J].重庆交通大学学报(自然科学版),2016,5(2):156-162. [11] GE B,HAN J H.Dynamic Adaptive Ant Colony Optimization Algorithm for Min-Max Vehicle Routing Problem[J].Pattern Recognition and Artificial Intelligence,2015,8(10):930-938.(in Chinese) 葛斌,韩江洪.最小最大车辆路径问题的动态自适应蚁群优化算法[J].模式识别与人工智能,2015,8(10):930-938. [12] STUTZLE T,HOOS H H.MAX-MIN Ant system[J].Future Generation Computer Systems,2000,16(9):889-914. [13] YAO Y.Research for the Improvement of Max-Min Ant Colony Algorithm[J].Mathematics in Practice and Theory,2014,4(15):242-247.(in Chinese) 姚艳.一种最大最小蚂蚁系统的改进算法[J].数学的实践与认识,2014,4(15):242-247. [14] DOU H L,LIU H D,YANG X G.OD matrix estimation method of public transportation flow based on passenger boarding and alighting[J].Computer and Communication,2007,5(2):79-83.(in Chinese) 窦慧丽,刘好德,杨晓光.基于站点上下客人数的公交客流OD反推方法研究[J].交通与计算机,2007,5(2):79-83. [15] WANG W Q.Research on Gas-Saving technology for City CNG buses[D].Xi’an:Chang’an University,2012.(in Chinese) 王文强.城市CNG公交车辆节气技术的研究[D].西安:长安大学,2012. |
No related articles found! |
|