TITLE

Delay Analysis for the Fixed-Cycle Traffic-Light Queue

AUTHOR(S)
Van Leeuwaarden, J. S. H.
PUB. DATE
May 2006
SOURCE
Transportation Science;May2006, Vol. 40 Issue 2, p189
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
We consider the fixed-cycle traffic-light (FCTL) queue, where vehicles arrive at an intersection controlled by a traffic light and form a queue. The traffic-light signal alternates between green and red periods, and delayed vehicles are assumed to depart during the green period at equal time intervals. Most of the research done on the FCTL queue assumes that the vehicles arrive at the intersection according to a Poisson process and focuses on deriving formulas for the mean queue length at the end of green periods and the mean delay. For a class of discrete arrival processes, including the Poisson process, we derive the probability generating function of both the queue length and delay, from which the whole queue length and delay distribution can be obtained. This allows for the evaluation of performance characteristics other than the mean, such as the variance and percentiles of the distribution. We discuss the numerical procedures that are required to obtain the performance characteristics, and give several numerical examples.
ACCESSION #
23830213

 

Related Articles

  • PRIORITY QUEUES WITH RANDOM ORDER OF SERVICE. Durr, L. // Operations Research;Mar/Apr71, Vol. 19 Issue 2, p453 

    Calls of two priorities arrive at a single server in accordance with a Poisson process. The calls are served in order of priority and for each priority in a random manner. This paper considers cases of preemptive-resume and nonpreemptive priorities, and derives the moments of the stationary...

  • ON TWO TYPES OF QUEUEING PROCESS INVOLVING BATCHES. Mohanty, S. G.; Jain, J. L. // CORS Journal;Mar70, Vol. 8 Issue 1, p38 

    A method is given for obtaining the distribution of the busy period in two types of single-server queueing processes involving batches: (a) where customers arrive in batches according to a Poisson process and the service times have a general distribution; (b) where customers arrive according to...

  • A SINGLE-SERVER PRIORITY QUEUING SYSTEM WITH GENERAL HOLDING TIMES, POISSON INPUT, AND REVERSE-ORDER-OF-ARRIVAL QUEUING DISCIPLINE. Durr, L. // Operations Research;Mar/Apr69, Vol. 17 Issue 2, p351 

    This paper gives an explicit formula for the waiting-time distribution in a single-server system with general holding times subject to a Poisson input from any number of priority classes. In the general case, where the holdingtime distributions of the demands in each priority case are different,...

  • Waiting Time in an S-1, S Inventory System with Arbitrarily Distributed Lead Times. Kruse, W. Karl // Operations Research;Mar/Apr80, Vol. 28 Issue 2, p348 

    The customer waiting time distribution is derived for an S-1,S continuous review inventory system experiencing Poisson demands and general independent identically distributed lead times. The analysis uses results from the infinite server Poisson queue. Some comparisons are made with an...

  • GENERALIZED INTEGRATED TELEGRAPH PROCESSES AND THE DISTRIBUTION OF RELATED STOPPING TIMES. Zacks, S. // Journal of Applied Probability;Jun2004, Vol. 41 Issue 2, p497 

    Let {X(t), V(t), t = 0) be a telegraph process, with V(0+) = 1. The distribution of X(t) is derived for the general case of an alternating renewal process, describing the length of time a particle is moving to the right or to the left. The distributions of the first-crossing times of given...

  • FLOWS IN QUEUEING NETWORKS: A MARTINGALE APPROACH. Walrand, J.; Varaiya, P. // Mathematics of Operations Research;Aug81, Vol. 6 Issue 3, p387 

    This paper applies thc filtering theory for point process observations to the analysis of flows in networks. An abstract model for the study of Markovian queueing systems is developed and used to derive the filtering equations satisfied by the conditional probability distribution of the state...

  • Waiting Time In a Multi-Server Cutoff-Priority Queue, and Its Application to an Urban Ambulance Service. Taylor, I. D. S.; Templeton, J. G. C. // Operations Research;Sep/Oct80, Vol. 28 Issue 5, p1168 

    We consider a priority queue in steady state with N servers, two classes of customers, and a cutoff service discipline. Low priority arrivals are "cut off" (refused immediate service) and placed in a queue whenever N[sub 1] or more servers are busy, in order to keep N-N[sub 1] servers free for...

  • Mt/G/∞ Queues with Sinusoidal Arrival Rates. Eick, Stephen G.; Massey, William A.; Whitt, Ward // Management Science;Feb1993, Vol. 39 Issue 2, p241 

    In this paper we describe the mean number of busy servers as a function of time in an M[sub t]/ G/Infinity queue (having a nonhomogeneous Poisson arrival process) with a sinusoidal arrival rate function. For an M[sub t]/G/Infinity model with appropriate initial conditions, it is known that the...

  • M/ M/∞ Queue with ON-OFF Service Speeds. D'Auria, B. // Journal of Mathematical Sciences;Jan2014, Vol. 196 Issue 1, p37 

    In this paper we analyze of a special kind of M/M/∞ queueing system. We assume that the rate of the servers alternates between two speeds according to an ON-OFF process whose ON periods are exponentially distributed and with general OFF periods. We look at the particular case where the OFF...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics