Optimal single-route transit-vehicle handling.

Author(s)
Ceder, A.
Year
Abstract

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

Request publication

4 + 10 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
C 48417 (In: C 48400) /72 /71 / ITRD E144875
Source

In: Transportation and traffic theory 2007 : papers selected for presentation at the 17th International Symposium on Transportation and Traffic Theory (ISTTT17), held at the Institution of Mechanical Engineers, London, UK from July 23 - 25, 2007, p. 385-405, 21 ref.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.