Efficient Timetabling and Vehicle Scheduling for Public Transport

This work attempts to combine the creation of public transport timetables and vehicle scheduling so as to improve the correspondence of vehicle departure times with passenger demand while minimizing the resources (the fleet size required). The methods pre

  • PDF / 2,614,155 Bytes
  • 16 Pages / 439.37 x 666.14 pts Page_size
  • 22 Downloads / 187 Views

DOWNLOAD

REPORT


Abstract. This work attempts to combine the creation of public transport timetables and vehide scheduling so as to improve the correspondence of vehide departure times with passenger demand while minimizing the resources (the fleet size required). The methods presented for handling the two components simultaneously can be applied for both single and interlining transit routes, and can be carried out in an automated manner. With the growing problems of transit reliability, and advances in the technology of passen ger information systems, the importance of even and clock headways is reduced. This a1lows for the possibility to create more efficient schedules from both the passenger and operator perspectives. The procedures presented are accompanied by examples and graphical explanations. It is emphasized that the public timetable is one of the predominant bridges between the operator (and community) and the passengers.

1

Introduction

In general terms, the public transport operational planning process includes four basic components performed in sequence: (1) network route design, (2) setting timetables, (3) scheduling vehicles to trips, and (4) assignment of drivers (crew). It is desirable for all four components to be planned simultaneously to exploit the system's capability to the greatest extent and maximize the system's productivity and efficiency. However, this planning process is extremely cumbersome and complex, and, therefore, seems to require separate treatment of each component, with the outcome of one fed as an input to the next component. In the last 25 years, a considerable amount of effort has been invested in the computerization of the four components mentioned above , in order to provide more efficient controllable and responsive schedules. The best summary as weil as the accumulative knowledge of this effort was presented in the books edited by Wren (1981); Rousseau (1985); Daduna and Wren (1988); Desrochers and Rousseau (1992); Daduna et al. (1995); Wilson (1999). This work attempts to combine the two components of creating timetables and vehicle scheduling so as to improve the correspondence of vehicle deparS. Voß et al. (eds.), Computer-Aided Scheduling of Public Transport © Springer-Verlag Berlin Heidelberg 2001

Ceder

38

ture times with passenger demand while minimizing the resources (the fleet size required). While the vehicle scheduling problem is treated extensively in the books mentioned above, only little attention is given to the problem of efficiently constructing vehicle frequencies and timetables. Mathematical programming methods for determining frequencies and timetables have been proposed by several authors as folIows. The objective in Furth and Wilson (1981) is to maximize the net social benefit, consisting of ridership benefit and wait time saving, subject to constraints on total subsidy, fleet size and passenger loading levels. Koutsopoulos et al. (1985) extended this formulation by incorporating crowding discomfort costs in the objective function and treating the time dependen