The transit operation planning process commonly includes four basic activities , usually performed in the sequence (1) network route design, (2) timetable development, (3) vehicle scheduling, and (4) crew scheduling. This work has two major aims: to describe the task of vehicle scheduling and possible math-programming solutions for a single transit route, and to proffer a graphical technique that is easy to interact with and responds to practical concerns. Firstly, a formula is derived to find the minimum fleet size required for a single route without deadheading trips and for a fixed schedule. Secondly, a graphical person-computer interactive approach, based on a step function called deficit function, is proffered for minimizing single-route fleet size and creating vehicle schedules with deadheading trip insertions. Thirdly, the formula and procedure to attain single-route minimum fleet size are extended to include possible shifts in trip-departure times for given shifting tolerances. For the covering abstract see ITRDE144727. Reprinted by permission of Elsevier
Samenvatting