交通运输系统工程与信息 ›› 2021, Vol. 21 ›› Issue (4): 211-220.DOI: 10.16097/j.cnki.1009-6744.2021.04.026

• 系统工程理论与方法 • 上一篇    下一篇

基于列生成启发式的单线电动公交车与司机整合调度优化

刘昊翔a,吴啊峰a,龙建成*a, b,周珏a   

  1. 合肥工业大学,a. 汽车与交通工程学院;b. 工业安全与应急技术安徽省重点实验室,合肥 230009
  • 收稿日期:2021-04-13 修回日期:2021-06-02 接受日期:2021-06-11 出版日期:2021-08-25 发布日期:2021-08-23
  • 作者简介:刘昊翔(1987- ),女,山东平度人,副研究员,博士。
  • 基金资助:
    国家自然科学基金;中央高校基本科研业务费专项资金

Column Generation-based Heuristic Approach for Electric Bus and Driver Scheduling on Single Bus Lines

LIU Hao-xianga , WU A-fenga , LONG Jian-cheng* a, b, ZHOU Jue a   

  1. a. School of Automotive and Transportation Engineering; b. Anhui Province Key Laboratory of Industry Safety and Emergency Technology, Hefei University of Technology, Hefei 230009, China
  • Received:2021-04-13 Revised:2021-06-02 Accepted:2021-06-11 Online:2021-08-25 Published:2021-08-23
  • Supported by:
    National Natural Science Foundation of China(71801067, 71925001); Fundamental Research Funds for Central Universities(JZ2020HGTB0026)。

摘要: 在考虑电动公交车里程约束与司机连续工作时间和总工作时间约束的基础上,研究单条 公交线路的电动公交车与司机整合调度问题,即将给定时刻表车次分配给电动公交车和司机,同 时,生成车辆运营计划和司机排班计划,设计基于列生成启发式方法求解提出的整合调度问题。 列生成方法用于生成线性松弛最优解,将整个问题分解为一个主问题和两个定价子问题。其中, 主问题从可行车辆行车路径集合和司机车次链集合中选择最优的司机车次链和电动公交车行车 路径,覆盖所有车次,并保证车辆运营计划产生的空驶弧都被司机排班计划覆盖;定价子问题描 述两个基于时空网络的资源约束最短路问题,分别用于生成可行的车辆路径和司机车次链,并设 计深浅算法得到整数可行解。使用合肥市3条公交线路随机生成算例检验提出算法的有效性。

关键词: 城市交通, 整合调度, 列生成算法, 电动公交车, 时空网络, 资源约束最短路

Abstract: This paper investigates the integrated electric buses and drivers scheduling problem for single bus lines. The trips are assigned to both electric buses and drivers to generate vehicle utilization plan and driver scheduling plan, which considers the range anxiety of electric bus and the constraints of driver's continuous working hours and total working time. The procedure ensures that all trips are covered by vehicle utilization plan and driver schedule plan and the deadhead trip generated by vehicle utilization plan are also covered by driver schedule plan. The column generation based heuristic algorithm is designed to solve the problem, which can be decomposed into a master problem and two pricing subproblems. The master problem determines driver schedules and electric bus routes from the feasible vehicle routes set and driver schedules set and ensure that all trips and deadhead trips generated by vehicle utilization are covered by electric buses and drivers. The pricing subproblem is described as two shortest path problems with resource constraints based on time-space networks to generate feasible vehicle routes and driver schedules. Then the pure diving heuristic approach is used to obtain the integer solution. Three random bus routes in Hefei city are used as examples to test the effectiveness of the proposed algorithm.

Key words: urban traffic, integrated scheduling, column generation, electric bus, time- space network, constrained shortest path

中图分类号: