英文资料The Booth Tolls for you.docVIP

The Booth Tolls for You Basic Queuing Theory Model Assumptions There is only one type of driver in the system. In navigating toll plaza traffic, all drivers act according to the same set of rules. Although the individual decisions of any given driver are probabilistic, the associated probabilities are the same for all drivers. The number of highway lanes does not exceed the number of tollbooths. An obvious solution to the posed problem may especially occur to those sitting still at a traffic plaza: namely, set the number of tollbooths equal to zero. The assumption above instead ensures that the number of tollbooths must be strictly positive. All tollbooths offer the same service and vehicles do not distinguish between them. We seek to improve toll plaza efficiency by optimizing the number of tollbooths – not the services they provide. While several types of tollbooth exist in practice, we have not been charged with distinguishing between them and suggesting their selective use. This is a problem of a different nature. Later, we return to this assumption and list ways in which our solution might change in response to multiple booth types. 假设： 只有一种类型的车通过此系统。 司机在行驶过程中，选择左右两边的概率一样：0.5。则在收费广场前形成的总的车队形状为类似于 收费亭的数量要多于进入收费广场的道路的数量 If there are not enough toll booths, queues will form If there are too many toll booths, a traffic jam will ensue when cars merge onto the narrower highway Important Assumptions We minimize wait time Cars arrive uniformly in time (toll plazas are not near exits or on-ramps) Wait time is memoryless Cars and their behavior are identical Queuing Theory We model approaching and waiting as an M|M|n queue Queuing Theory Results The expected wait time for the n-server queue with arrival rate (, service (, (=(/( This shows how long a typical car will wait - but how often do they leave the tollbooths? Queueing Theory Results The probability that d cars leave in time interval (t is: This characterizes the first half of the toll plaza! Merging Simple Mo