期刊文献+

赛事公交车辆路径优化研究——以2022年北京冬奥为例

Research on vehicle routing problem of event bus:Taking 2022 Beijing Winter Olympics Games as an example
下载PDF
导出
摘要 国际重大赛事活动通常具有多场馆联合承办赛事项目的特征,针对观赛人群在单比赛日内观看多场赛事活动的出行需求,考虑时间窗约束和载量约束,建立以最小化运营赛事公交使用、开行成本为目标的赛事公交车辆路径优化问题模型.模型考虑赛事公交载量及服务时间窗约束,利用两种有效不等式、禁忌搜索算法和基于最优时差插入法的遗传算法实现求解.最后,以2022年北京冬季奥运会两个比赛日的赛事项目为背景构建不同规模案例,对模型和算法进行验证分析.结果表明:所提出的方法可根据优化目标提供车辆路径优化方案,通过两种有效不等式能够提高57.3%的精确求解计算效率,采用遗传算法计算效率提升99.4%,能够适应不同规模算例的求解. Major international events are usually characterized by the hosting events in multiple venues.Based on the travel demand of spectators who want to watch several events in a day during major international events,an route optimization model for event buses with the objective of minimizing the use of event buses and driving costs is established considering the time window constraint and the load constraint.Demand-responsive transit service is conducive to flexibly meeting the travel demand of spectators during the event,which can reduce the difficulty of travel decisions and the waiting time for travel.The two set of valid inequalities,tabu search algorithm and a genetic algorithm based on the optimal time difference insertion method are used to solve the model.Finally,the model and algorithm are verified and analyzed with the case of two competition days in 2022 Beijing Winter Olympic Games.The results show that the proposed method can provide optimized event bus routing scheme according to the optimized objective function.The computational efficiency of the solution is improved by 57.3%by the two set of valid inequalities,and improved by 99.4%by using the genetic algorithm,which can adapt to the calculation of actual cases in different scales.
作者 官云林 王云 闫学东 郭浩楠 GUAN Yunlin;WANG Yun;YAN Xuedong;GUO Haonan(School of traffic and transportation,Beijing Jiaotong University,Beijing 100044,China;Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport,Beijing Jiaotong University,Beijing 100044,China)
出处 《北京交通大学学报》 CAS CSCD 北大核心 2021年第6期87-93,共7页 JOURNAL OF BEIJING JIAOTONG UNIVERSITY
基金 国家重点研发计划(2019YFF0301403)。
关键词 车辆路径问题 有效不等式 遗传算法 赛事公交 需求响应公交 vehicle routing problem valid inequality genetic algorithm event bus demand-responsive transit service
  • 相关文献

参考文献2

二级参考文献15

  • 1Dantzig G B, Ramser J H. The truck dispatching problem[J]. Management Science, 1959, 6(1): 80-91.
  • 2Rekiek B, Delchambre A, Saleh H A. Handicapped person transportation: An application of the grouping genetic algorithm[J]. Eng Appl Artif Intel, 2006, 19:511-520.
  • 3Fagerholt K, Christiansen M. A combined ship scheduling and allocation problem[J]. Journal Operation Research Society 2000, 51:834-842.
  • 4Li H, Lim A. A metaheuristic for the pickup and delivery problem with time windows[C]// 13th IEEE Inter- national Conference on Tools with Artificial Intelligence, IEEE Computer Society, Los Alamitos, CA, 2001: 333-340.
  • 5Pankratz G. A grouping genetic algorithm for the pickup and delivery problem with time windows[J]. Operation Research Spectrum, 2005, 27: 21-41.
  • 6Popken D A. Controlling order circuity in pickup and delivery problems[J]. Transport Research E-Log, 2006, 42: 431-443.
  • 7Bent R, Van Hentenryck P. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows[J]. Compute Operation Research, 2006, 33: 875-893.
  • 8Savelsbergh M W P, Sol M. The general pickup and delivery problem[J]. Transportation Science, 1995, 29: 17-29.
  • 9Solomon M. Algorithms for the vehicle routing and scheduling problem with time window constraints[J]. Operations Research, 1987, 35(2): 254-265.
  • 10Holland J H. Adaptation in Natural and Artificial Systems An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence[M]. The University of Michigan Press, Ann, 1975.

共引文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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