IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v5y1971i1p91-105.html
   My bibliography  Save this article

Dispatching Policies for a Transportation Route

Author

Listed:
  • G. F. Newell

    (University of California, Berkeley, California)

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.

Suggested Citation

  • G. F. Newell, 1971. "Dispatching Policies for a Transportation Route," Transportation Science, INFORMS, vol. 5(1), pages 91-105, February.
    • Handle: RePEc:inm:ortrsc:v:5:y:1971:i:1:p:91-105
    DOI: 10.1287/trsc.5.1.91
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.5.1.91
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.5.1.91?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:5:y:1971:i:1:p:91-105. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.