美国数学建模竞赛特等奖论文——2005 B O For Whom the Booth Tolls【数学建模】.pdfVIP

228 The UMAPJournal 26.3 (2005) For Whom the Booth Tolls Brian Camley Bradley Klingenberg Pascal Getreuer University of Colorado Boulder, CO Advisor: Anne Dougherty Summary We model traffic near a toll plaza with a combination of queueing theory and cellular automata in order to determine the optimum number of tollbooths. We assume that cars arrive at the toll plaza in a Poisson process, and that the probability of leaving the tollbooth is memoryless. This allows us to completely and analytically describe the accumulation of cars waiting for open tollbooths as an MIMIn queue. We then use a modified Nagel-Schreckenberg (NS) cellu- lar automata scheme to model both the cars waiting for tollbooths and the cars merging onto the highway. The models offer results that are strikingly consis- tent, which serves to validate the conclusions drawn from the simulation. We use our NS model to measure the average wait time at the toll plaza. From this we demonstrate a general method for choosing the number of toll- booths to minimize the wait time. For a 2-lane highway, the optimal number of booths is 4; for a 3-lane highway, it is 6. For larger numbers of lanes, the result depends on the arrival rate of the traffic. The consistency of our model with a variety of theory and experiment sug- gests that it is accurate and robust. There is a high degree of agreement between the queueing theory results and the corresponding NS results. Special cases of our NS results are confirmed by empirical data from the literature. In addition, changing the distribution of the tollbooth wait time and changing the probabil- ity of random braking does not significantly alter the recommendations. This presents a compelling validation of our models and general approach. The text of this paper appears on pp. 373-390. The UMAPJournal26 (3) (2005) 228. @Copy