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

Control of Pairing of Vehicles on a Public Transportation Route, Two Vehicles, One Control Point

Author

Listed:
  • G. F. Newell

    (University of California, Berkeley, California)

Abstract

If the time required for a vehicle (particularly buses or elevators) to load passengers is an increasing function of the number of passengers loaded, then, on a route served by more than one vehicle, the vehicles tend to form pairs. If a vehicle runs behind (ahead of) schedule, it typically will pick up more (less) passengers and get even further behind (ahead of) schedule. The following is concerned with a shuttle type of route having just two vehicles and serving passengers who arrive at a constant rate. There is one control point at which vehicles can be intentionally delayed. The object is to devise a strategy of control that will minimize the average waiting time of the passengers. The strategy must correct for random fluctuations in trip time so that the headways will not become sufficiently unequal as to initiate effects of pairing. An approximate solution of the optimization problem suggests that the optimal control involves sufficiently tight control that the pairing effect has little influence on the waiting times.

Suggested Citation

  • G. F. Newell, 1974. "Control of Pairing of Vehicles on a Public Transportation Route, Two Vehicles, One Control Point," Transportation Science, INFORMS, vol. 8(3), pages 248-264, August.
  • Handle: RePEc:inm:ortrsc:v:8:y:1974:i:3:p:248-264
    DOI: 10.1287/trsc.8.3.248
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.8.3.248
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.8.3.248?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:8:y:1974:i:3:p:248-264. 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.