Optimal Multi-Vehicle Type Transit Timetabling and Vehicle Scheduling
Optimal Multi-Vehicle Type Transit Timetabling and Vehicle Scheduling
复制标题
DOI：
10.1016/j.sbspro.2011.08.005
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
A. Ceder
中科院分区：
文献类型：
--
作者：
A. Ceder
公共交通运营规划过程通常包括四个基本活动，通常按顺序执行：网络设计，时间表制定，车辆调度和机组人员调度。这项工作涉及两个活动：时间表的开发和车辆调度与不同的车辆类型。可供选择的时刻表可以是平均发车间隔，但不一定是平均载客量，也可以是平均载客量，但不一定是平均发车间隔。提出了一种基于均匀车头时距和均匀载重概念的多车型时刻表编制方法。车辆调度问题是基于给定的行程和车辆类型的车辆成本降序排列。该问题可以表述为具有NP难复杂性级别的成本流网络问题。因此，开发了一种启发式算法。几个例子被用来作为一个暂时的设备来说明开发的程序。
The public-transport (transit) operation planning process commonly includes four basic activities, usually performed in sequence: network design, timetable development, vehicle scheduling, and crew scheduling. This work addresses two activities: timetable development and vehicle-scheduling with different vehicles types. Alternative timetables are constructed with either even headways, but not necessarily even passenger loads or even average passenger loads, but not even headways. A method to construct timetables with the combination of both even-headway and even-load concepts is developed for multi-vehicle sizes. The vehicle-scheduling problem is based on given sets of trips and vehicle types arranged in decreasing order of vehicle cost. This problem can be formulated as a cost-flow network problem with an NP-hard complexity level. Thus, a heuristic algorithm is developed. A few examples are used as an expository device to illustrate the procedures developed.