Urban transit scheduling: Framework, review and examples

被引:83
作者
Ceder, A [1 ]
机构
[1] Technion Israel Inst Technol, Fac Civil Engn, Transportat Res Inst, IL-32000 Haifa, Israel
来源
JOURNAL OF URBAN PLANNING AND DEVELOPMENT-ASCE | 2002年 / 128卷 / 04期
关键词
urban areas; public transportation; scheduling;
D O I
10.1061/(ASCE)0733-9488(2002)128:4(225)
中图分类号
TU [建筑科学];
学科分类号
0813 [建筑学];
摘要
A transit operational planning process includes four basic components performed usually in sequence: (1) network route design; (2) setting timetables; (3) scheduling vehicles to trips: and (4) assignment of drivers. This planning process is extremely cumbersome and complex and often creates confusion in its interrelationships among researchers and practitioners. The purpose of this work is to construct a framework and to provide an overview and examples of certain practical methodologies aimed at solving the transit scheduling problems. In the past 20 years, a considerable amount of effort has been invested in the computerization of the four components mentioned above. This is in order to provide more efficient, controllable, and responsive schedules. Nonetheless, despite the software used, no system is yet able to solve large scheduling problems, and manual intervention is necessary. There is a need to bridge the gap between the software system designers and the transit schedulers via the identification and organization of all the elements involved, including the current availability of data. This work emphasizes certain data needs along with examples for crystallizing and clarifying the transit scheduling undertaking. It is suggested that most of the scheduling tasks can be performed automatically, but it is preferable to undertake some of them through a conversational man-computer mode.
引用
收藏
页码:225 / 244
页数:20
相关论文
共 30 条
[1]
[Anonymous], 1999, LECT NOTES EC MATH S
[2]
[Anonymous], 2001, LECT NOTES EC MATH S
[3]
[Anonymous], 1992, LECT NOTES EC MATH S
[4]
A HEURISTIC-PROCEDURE FOR THE CREW ROSTERING PROBLEM [J].
BIANCO, L ;
BIELLI, M ;
MINGOZZI, A ;
RICCIARDELLI, S ;
SPADONI, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 58 (02) :272-283
[5]
BONDIN L, 1983, COMPUTERS OPERATION, V10, P63
[6]
Caprara A, 1999, LECT NOTES ECON MATH, V471, P1
[7]
A MULTI-LEVEL BOTTLENECK ASSIGNMENT APPROACH TO THE BUS DRIVERS ROSTERING PROBLEM [J].
CARRARESI, P ;
GALLO, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 16 (02) :163-173
[8]
A step function for improving transit operations planning using fixed and variable scheduling [J].
Ceder, A .
TRANSPORTATION AND TRAFFIC THEORY IN THE 21ST CENTURY, 2002, :1-21
[9]
A PROCEDURE TO ADJUST TRANSIT TRIP DEPARTURE TIMES THROUGH MINIMIZING THE MAXIMUM HEADWAY [J].
CEDER, A .
COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (05) :417-431