Abstract: The transit-operation planning process commonly includes four basic activities, usually performed in sequence: (1) network route design, (2) timetable development, (3) vehicle scheduling, and (4) crew scheduling. The output of each activity positioned higher in the sequence becomes an important input for lower-level decisions. However, it is desirable for all four activities to be planned simultaneously in order to exploit the system’s capability to the greatest extent and to maximize the system’s productivity and efficiency. However it is desirable for all four activities to be planned simultaneously in order to exploit the system’s capability to the greatest extent and to maximize the system’s productivity and efficiency. However, since this planning process, especially for medium to large transit fleets, is extremely cumbersome and complex, separate treatment is required for each activity, with the outcome of one fed as an input to the next. This work has two major aims: (1) to describe the task of vehicle scheduling and possible math-programming solutions for a single transit route; (2) to proffer a graphical technique that is easy to interact with and response to practical concerns. Single transit routes deal with both fixed and variable schedules. In fixed schedules, departure times cannot be changed. In practical transit scheduling, however, schedulers should attempt to allocate vehicles in the most efficient manner possible, including the employment of small shifts in departure times.
Publication Year: 2007
Publication Date: 2007-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot