美国数学建模竞赛特等奖论文——2005 B O The Booth Tolls for Thee【数学建模】.pdfVIP

222 The UMAPJournal 26.3 (2005) The Booth Tolls for Thee Adam Chandler Matthew Mian Pradeep Baliga Duke University Durham, NC Advisor: William G. Mitchener Summary We determine the optimal number of tollbooths for a given number of in- coming highway lanes. We interpret optimality as minimizing total cost to the system, the time that the public wastes while waiting to be processed plus the operating cost of the tollbooths. We develop a microscopic simulation of line-formation in front of the toll- booths. We fit a Fourier series to hourly demand data from a major New Jersey parkway. Using threshold analysis, we set upper bounds on the number of tollbooths. This simulation does not take bottlenecking into account, but it does inform a more general macroscopic framework for toll plaza design. Finally,we formulate a model for traffic flow through a plaza using cellular automata. Our results are summarized in the formula for the optimal number B of tollbooths for L lanes: B = [1.65L + 0.9]. The text of this paper appears on pp. 283-297. The UMAPJournal26 (3) (2005) 222. @Copyright 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 and that copies bear this notice. Abstracting with credit is permitted, but copyrights for components of this work owned by others than COMAP must be honored. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior permission from COMAP. The Booth Tollsfor Thee 283 The Booth Tolls for Thee Adam Chandler Matthew Mian Pradeep Baliga Duke University Durham, NC Advisor: William G. Mitchener Summary