Building our Way Out of Congestion? Highway Capacity for the Twin Cities

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Building our Way Out of Congestion? Highway Capacity for the Twin Cities

Published Date

2001-07-01

Publisher

Type

Abstract

The problem of identifying a set of capacity expansions that are in some sense optimal, while accounting for traveler reaction, is known as a network design problem. A literature review reveals numerous formulations and solution algorithms over the last three decades, but the problem of implementing these for large-scale networks has remained a challenge. This project presents a solution procedure that incorporates the capacity expansion as a modified step in the Method Successive Averages, providing an efficient algorithm capable of solving realistic problems of real-world complexity. Application of this method addresses the network design problem for the freeway system of the Twin Cities by providing a lower bound on the extent to which physical expansion of highway capacity can be used to accommodate future growth. The solution estimates that adding 1,844 lane-kilometers, or 1,146 lane-miles, would be needed to accommodate the demand predicted for the year 2020.

Keywords

Description

Related to

Replaces

License

Collections

Series/Report Number

Funding information

Minnesota Department of Transportation

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Davis, Gary A.; Sanderson, Kate. (2001). Building our Way Out of Congestion? Highway Capacity for the Twin Cities. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/746.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.