Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-23T09:45:57.552Z Has data issue: false hasContentIssue false

WAITING TIMES AT PERIODICALLY SWITCHED ONE-WAY TRAFFIC LANES

A PERIODIC, TWO-QUEUE POLLING SYSTEM WITH RANDOM SETUP TIMES

Published online by Cambridge University Press:  11 January 2002

Matthieu van der Heijden
Affiliation:
Centre for Production, Logistics and Operations Management, Faculty of Technology and Management, University of Twente, Enschede, The Netherlands, E-mail: [email protected]
Aart van Harten
Affiliation:
Centre for Production, Logistics and Operations Management, Faculty of Technology and Management, University of Twente, Enschede, The Netherlands
Mark Ebben
Affiliation:
Centre for Production, Logistics and Operations Management, Faculty of Technology and Management, University of Twente, Enschede, The Netherlands

Abstract

We study vehicle waiting times at a traffic lane that is shared by traffic from two directions. In contrast to crossovers, we focus on instances where the vehicle passing time of the shared infrastructure can be large. The motivation for this model arises from our research on underground transportation systems. We examine vehicle waiting times under periodic control rules (i.e., the driving direction on the infrastructure is switched between two directions according to a fixed time schedule). We analyze both symmetric and asymmetric systems (i.e., vehicle arrival rates as well as effective green and red periods may be different for both directions). In fact, we are dealing with a single server, two-queue polling system with random setup times and periodic (nonexhaustive) service discipline. We develop approximations for the mean waiting time and we show by comparison to simulation results that the accuracy is usually in the range of 1–2% for Poisson arrivals. Also, we indicate how our approximations can be generalized to compound Poisson arrivals.

Type
Research Article
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)