Network Design Programming of U.S. Highway Improvements

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 of 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.

[1]  F. Glover A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[2]  Nazim U. Ahmed An analytical decision model for resource allocation in highway maintenance management , 1983 .

[3]  Bruce N Janson Method of Programming Regional Highway Projects , 1988 .

[4]  David E. Boyce,et al.  A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows , 1986 .

[5]  Y. Toyoda A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .

[6]  M. Turnquist,et al.  Approximate algorithms for the discrete network design problem , 1982 .

[7]  P. H. Müller,et al.  Boyce, D. E./Farhi, A./Weischedel, R., Optimal Subset Selection, Multiple Regression, Interdependence and Optimal Network Algorithms. Berlin-Heidelberg-New York. Springer-Verlag. 1974. 187 S., DM 20,-. (Lecture Notes in Economics and Mathem. Systems 103) , 1979 .

[8]  Hoang Hai Hoc A Computational Approach to the Selection of an Optimal Network , 1973 .

[9]  B. Ashtakala,et al.  Optimized Gravity Models for Commodity Transportation , 1988 .

[10]  Bruce N. Janson,et al.  Heuristic ranking and selection procedures for network design problems , 1987 .

[11]  Alan Wilson,et al.  A statistical theory of spatial distribution models , 1967 .

[12]  David E. Boyce,et al.  A discrete transportation network design problem with combined trip distribution and assignment , 1980 .

[13]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[14]  A. M. Geoffrion Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[15]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[16]  S. P. Evans A relationship between the gravity model for trip distribution and the transportation problem in linear programming , 1973 .

[17]  E. Balas An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[18]  David E. Boyce,et al.  Solutions to the optimal network design problem with shipments related to transportation cost , 1979 .

[19]  Michael Florian,et al.  Exact and approximate algorithms for optimal network design , 1979, Networks.

[20]  David E. Boyce,et al.  Optimal Subset Selection , 1974 .

[21]  Alan Wilson,et al.  Entropy in urban and regional modelling , 1972, Handbook on Entropy, Complexity and Spatial Dynamics.