Dispatching Policies for a Transportation Route

G. F. Newell
Additional contact information
G. F. Newell: University of California, Berkeley, California

Transportation Science, 1971, vol. 5, issue 1, 91-105

Abstract: Suppose that a given number n of vehicles (buses, trains, etc.) maybe dispatched at any times from some source to serve passengers along a route. The arrival rate of passengers is some given (nonconstant) smooth function of time, typically having one or more peaks. One wishes to choose the dispatch times t j , j = 1, ..., n in such a way as to minimize the total waiting time of all passengers. It is shown that if the capacity of the vehicles is sufficiently large to serve all waiting passengers and n is large, then the optimal flow rate of vehicles (reciprocal of the headways) and the number of passengers served per vehicle, both vary with time approximately as the square root of the arrival rate of passengers. If the vehicles have limited capacity, their dispatch schedule will be distorted so that certain vehicles are dispatched as soon as they are full.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (58)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.5.1.91 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:5:y:1971:i:1:p:91-105

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().