美国数学建模竞赛特等奖论文——2005 B O The Multiple Single Server Queueing System【数学建模】.pdfVIP

226 The UMAPJournal 26.3 (2005) The Multiple Single Server Queueing System Azra Panjwani Yang Liu HuanHuan Qi University of California, Berkeley Berkeley, CA Advisor: Jim Pitman Summary Our model determines the optimal number of tollbooths at a toll plaza in terms of that minimizing the time that a car spends in the plaza. We treat the toll collection process as a network of two exponential queueing systems, the Toll Collection system and the Lane Merge System. The random, memoryless nature of successive car interarrival and service times allows us to conclude that the two are exponentially distributed. We use properties of single server and multiple server queuing systems to develop our Multiple Single Server Queuing System. We simulate our network in Matlab, analyzing the models performance in light, medium, and heavy traffic for tollways with 3 to 6 lanes. The optimal number of tollbooths is roughly double the number of lanes. We also evaluate a single tollbooth vs. multiple tollbooths per lane. The optimal number of booths improves the processing time by 22% in light traffic and 61% in medium traffic. In heavy traffic, one tollbooth per lane results in infinite queues. Our model produces consistent results for all traffic situations, and its flex- ibility allows us to apply it to a wide range of toll-plaza systems. However, the minimum time predicted is an average value, hence it does not reflect the maximum time that an individual may spend in the network. The text of this paper appears on pp. 345-354. The UMAPJournal26 (3) (2005) 226. gCopyright 2005 by COMAP, Inc. All rights reserved. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage a