摘要
公交乘务排班是公交智能化调度的重要研究内容.目前我国大多数城市排班主要采用人工经验,具有很大盲目性和繁琐性,且排班结果多为单车场的乘务组排班方案.本文以班次时间接续、乘务组劳动强度、车场能力等为约束条件,以最小化乘务组的车场驶入/驶出成本、停留等待成本和空驶成本为目标函数,建立了多车场公交乘务排班问题的数学模型.采用禁忌搜索算法求解模型,设计了初始生成解的启发式方法,提出了基于有序序列的班次交换和插入策略进行邻域搜索.选取两个车场范围内的四条公交线路为实例,进行仿真测算和数据分析.结果表明,利用本文模型得到的乘务排班结果能有效地处理多车场公交乘务组跨线排班问题.
Crew scheduling is an important element of intelligent transit dispatching. The scheduling methods of many cities in China are mainly based on artificial experience with great blindness and tediousness. Moreover, the scheduling results are mostly focused on the field of crew scheduling with a single depot. A mathematical model of multiple depots crew scheduling is formulated with the time shift of trips, work intensity for crew, capacity of depots as constrains, and with the minimum cost of pull-in/pull-out time, waiting time and deadheading as the objective function. The tabu search algorithm is used to solve the proposed model, and a heuristic algorithm is designed to generate the initial solution. A neighborhood search method with trip exchange and insert strategy is also presented based on the ordered sequence. Taking four bus lines with two depots as examples, the proposed model can effectively solve the crew scheduling problem with multiple depots which allows vehicles and crew running at the cross-lines.
出处
《交通运输系统工程与信息》
EI
CSCD
北大核心
2013年第5期159-166,共8页
Journal of Transportation Systems Engineering and Information Technology
基金
国家自然科学基金项目(71261014)
关键词
城市交通
乘务排班
禁忌搜索算法
班次
多车场
urban traffic
crew scheduling
tabu search algorithm
trips
multiple depots
