TECHNICAL PAPERS
Jul 1, 1991

Network Design Programming of U.S. Highway Improvements

Publication: Journal of Transportation Engineering
Volume 117, Issue 4

Abstract

This paper describes a network design approach to the selection and programming of alternative route improvements to the U.S. highway network of interstates, four‐lane urban highways, and principal rural arterials. Alternative route‐improvement strategies are defined as mutually exclusive sets of link improvements that can be programmed for construction within any decade of a multidecade planning horizon. The two improvement strategies considered for each route are: (1) To make every link median divided with controlled access and at least four lanes; or (2) to make every link at least four lanes, but without any changes to median division or access control. The examples of this paper evaluate 536 potential improvements to 289 major highway routes between adjacent Bureau of Economic Analysis (BEA) regions, or nearly two improvement strategies per route. Route‐improvement strategies programmed for each decade are constrained by 10‐year funding allocations. A trip distribution model is used to distribute commodity shipments forecast for each decade among regions. Route‐improvement benefits are computed as changes in the value of the objective function, which is the total discounted interregional shipment cost for all years of the planning period. Since different routes and interregional shipments can share common links, a rank‐add‐and‐swap heuristic solution procedure was developed and applied that accounts for the interdependent costs and benefits of route improvements. Implications of this network design approach for planning future expansions and improvements of the interstate highway network are discussed.

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
Ahmed, N. U. (1983). “An analytical decision model for resource allocation in highway maintenance management.” Transp. Res. Part A, 17(2), 133–138.
2.
Ashtakala, B., and Murthy, A. S. N. (1988). “Optimized gravity models for commodity transportation.” J. Transp. Engrg., ASCE, 114(4), 393–408.
3.
Balas, E. (1965). “An additive algorithm for solving linear programs with zero‐one variables.” Oper. Res., 13(3), 517–546.
4.
Boyce, D. E., Farhi, A., and Weischedel, R. (1974). “Optimal subset selection, multiple regression, interdependence and optimal network algorithm.” Lecture notes in economics and mathematical systems. 103, Springer‐Verlag, Amsterdam, The Netherlands.
5.
Boyce, D. E., and Soberanes, J. L. (1979). “Solutions to the optimal network design problem with shipments related to transportation cost.” Transp. Res. Part B, 13(1), 65–80.
6.
Boyce, D. E., and Janson, B. N. (1980). “A discrete transportation network design problem with combined trip distribution and assignment.” Transp. Res. Part B, 14(2), 147–154.
7.
Dionne, R., and Florian, M. (1979). “Exact and approximate algorithms for optimal network design.” Networks, 9(1), 37–59.
8.
Evans, S. P. (1973). “A relationship between the gravity model for trip distribution and the transportation problem in linear programming.” Transp. Res., 7(1), 39–61.
9.
Geoffrion, A. M. (1965). “An improved implicit enumeration approach for integer programming.” Oper. Res., 13(5), 879–919.
10.
Geoffrion, A. M. (1967). “Integer programming by implicit enumeration and balas' method.” SI AM Rev., 9(2), 178–190.
11.
Hoang, H. H. (1973). “A computational approach to the selection of an optimal network.” Manage. Sci., 19(5), 488–498.
12.
Janson, B. N., and Husaini, A. (1987). “Heuristic ranking and selection procedures for network design problems.” J. Adv. Transp., 21(1), 17–46.
13.
Janson, B. N. (1988). “A method of programming regional highway projects.” J. Transp. Engrg., ASCE, 114(5), 584–606.
14.
LeBlanc, L. J. (1975). “An algorithm for the discrete network design problem.” Transp. Sci., 9(2), 183–199.
15.
LeBlanc, L. J., and Boyce, D. E. (1986). “A bi‐level programming algorithm for exact solution to the network design problem with user optimal flows.” Transp. Res. Part B, 20(3), 259–265.
16.
Los, M. (1976). “Optimal network problem without congestion: Some computational results.” Report No. 40, Centre de Recherche sur les Transports, Universite de Montreal, Montreal, Quebec, Canada.
17.
Magnanti, T. L., and Wong, R. T. (1984). “Network design and transportation planning: Models and algorithms.” Transp. Sci., 18(1), 1–55.
18.
Poorzahedy, H., and Turnquist, M. A. (1982). “Approximate algorithms for the discrete network design problem.” Transp. Res. Part B, 16(1), 45–55.
19.
Toyoda, Y. (1975). “A simplified algorithm for obtaining approximate solutions to zero‐one programming problems.” Manage. Sci., 21(12), 1417–1426.
20.
1988 county and city data book. (1988). Technical Documentation, U.S. Bureau of Census, U.S. Department of Commerce, Washington, D.C.
21.
Wilson, A. G. (1967). “A statistical theory of spatial distribution models.” Transp. Res., Part 1(3), 253–269.
22.
Wilson, A. G. (1970). Entropy in urban and regional modelling. Pion Limited, London, U.K.

Information & Authors

Information

Published In

Go to Journal of Transportation Engineering
Journal of Transportation Engineering
Volume 117Issue 4July 1991
Pages: 457 - 478

History

Published online: Jul 1, 1991
Published in print: Jul 1991

Permissions

Request permissions for this article.

Authors

Affiliations

Bruce N. Janson, Associate Member, ASCE
Assoc. Prof., Dept. of Civ. Engrg., Univ. of Colorado, Denver, CO 80217–3364
L. Scott Buckels
Sr. Operations Research Analyst, Union Camp Corporation, Wayne, NJ 07470
Bruce E. Peterson
Oak Ridge National Laboratory, P.O. Box 2008, Oak Ridge, TN 37831–6206

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share