IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v10y1962i1p105-114.html
   My bibliography  Save this article

Queuing for Gaps in High Flow Traffic Streams

Author

Listed:
  • R. M. Oliver

    (Institute of Transportation and Traffic Engineering, University of California, Berkeley)

  • E. F. Bisbee

    (Institute of Transportation and Traffic Engineering, University of California, Berkeley)

Abstract

In this paper the authors study the queues that build up in a minor stream of traffic waiting to cross or merge with a major stream. The criterion for joining or crossing is that a gap between vehicles in the major stream be greater than or equal to some constant value. Several authors have studied the case where bulk service is provided for the minor stream queue with the appearance of each gap, in this paper the authors emphasize the higher flow rate situations where one car in the minor stream queue is released in a first-come first-serve fashion with the appearance of a gap. It is assumed that the minor stream is Poisson-fed while the intervehicle headways in the major stream are arbitrary but identically and independently distributed random variables.

Suggested Citation

  • R. M. Oliver & E. F. Bisbee, 1962. "Queuing for Gaps in High Flow Traffic Streams," Operations Research, INFORMS, vol. 10(1), pages 105-114, February.
    • Handle: RePEc:inm:oropre:v:10:y:1962:i:1:p:105-114
    DOI: 10.1287/opre.10.1.105
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.10.1.105
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.10.1.105?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Osorio, Carolina & Flötteröd, Gunnar & Bierlaire, Michel, 2011. "Dynamic network loading: A stochastic differentiable model that derives link state distributions," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1410-1423.

    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:oropre:v:10:y:1962:i:1:p:105-114. 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.