Tandem-Queue Algorithm for Airport User Flows

by William J. Dunlay, Jr., (A.M.ASCE), Asst. Prof. of Civ. and Urban Engrg.; Univ. of Pennsylvania, Philadelphia, Pa.,
Chang-Ho Park, Instr.; Seoul National Univ., Seoul, Korea,

Serial Information: Transportation Engineering Journal of ASCE, 1978, Vol. 104, Issue 2, Pg. 131-149

Document Type: Journal Paper


A method is presented for relating, using simple functional notation, the cumulative arrival patterns of passengers at two successive sets of airport processing components. An algorithm is developed for the simplest case where all passengers go directly from one component to the next. In the algorithm there is provision for superimposing the arrival patterns of passengers of many different flights. The recursive equation of the algorithm is then generalized to accommodate more complex patterns of passenger flow with ancillary activities. A method is developed for estimating the total expected time spent between such processors as a function of the probability that passengers use particular ancillary activities, the associated dwell times at each, and the time spent going between activities. The overall algorithm is analytic and is intended for tying together deterministic queueing models of individual components so that the passenger flow through an entire airport can be analyzed.

Subject Headings: Passengers | Algorithms | Airports and airfields | Flow patterns | Flight | Probability

Services: Buy this book/Buy this article


Return to search