带时间窗的多车场公交乘务排班优化  

An Optimization for Bus Crew Scheduling with Multiple Depots under Time Window Condition

作　　者：陈明明[1] 牛惠民[1] 

机构地区：[1]兰州交通大学交通运输学院,甘肃兰州730070

出　　处：《兰州交通大学学报》2015年第4期100-106,共7页Journal of Lanzhou Jiaotong University

基　　金：国家自然科学基金(71261014);兰州交通大学青年基金(2013033)

摘　　要：考虑多车场因素下的城市公交乘务排班问题,允许车辆空驶策略增加了排班结果的灵活性;引入乘务时间窗的概念,充分考虑了乘务人员的基本利益.以最小化乘务组的车场驶入/驶出成本、停留等待成本和空驶成本为目标函数,建立了带时间窗的多车场公交乘务排班优化模型及禁忌搜索算法.最后通过算例计算得到多车场下公交线路的最优乘务排班方案.结果表明该方法在处理带有时间窗的多车场公交乘务组跨线排班问题具有良好的应用效果.The crew scheduling problem with multiple depots is considered in this paper.Adding the deadheading strategy can make the scheduling plan more flexible and introducing the concept of time window can satisfy the benefits of crew members.An optimization model with the mini-mum cost of pull-in/pull-out time,waiting time and deadheading as the objective function for bus crew scheduling with multiple depots under time window condition is formulated.The tabu search algorithm was used to solve the proposed model.Finally,the optimal crew scheduling program with multiple depots operated on several bus lines are calculated by one real example.The results show the method has a better effect on dealing with the bus crew scheduling problem with multi-ple depots under time window condition.

关 键 词：乘务排班 时间窗 多车场 禁忌搜索算法 

分 类 号：U491[交通运输工程—交通运输规划与管理]