Using decomposition in large-scale highway network design with a quasi-optimization heuristic

Transportation Research Part B: Methodological

Volumn 32, Issue 2, 1998, Pages 127-140

  Solanki, Rajendra S ^a   Gorti, Jyothi K ^a   Southworth, Frank ^a  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUDGET CONTROL; COSTS; HEURISTIC METHODS; OPTIMIZATION; TRANSPORTATION ROUTES;

HIGHWAY NETWORK DESIGN; LINK CONSTRUCTION COSTS; MODIFIED QUASI OPTIMIZATION HEURISTIC;

HIGHWAY ENGINEERING;

METHODOLOGY; NETWORK DESIGN; PLANNING METHOD; QUASI-OPTIMISATION HEURISTIC; ROAD TRANSPORT; TRANSPORT PLANNING;

EID: 0031988660     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0191-2615(97)00020-9     Document Type: Article

References (18)

1. Boyce, D. E. and Janson, B. N. (1980) A discrete transportation network design problem with combined trip distribution and assignment. Transportation Research Part B 14(2), 147-154.
2. Dionne, R. and Florian, M. (1979) Exact and approximate algorithms for optimal network design. Networks 9(1), 37-59.
3. Friesz, T. L. (1985) Transportation network equilibrium, design and aggregation: key developments and research opportunities. Transportation Research A 19(5/6), 413-427.
4. Haghani, A. E. and Daskin, M. S. (1983) Network design application of an extraction algorithm for network aggregation. Transportation Research Record, 944, 37-46, National Research Council, Washington, DC.
5. Hearn, D. W. (1984) Practical and theoretical aspects of aggregation problems in transportation planning models. In Transportation Planning Models ed. M. Florian, pp. 257-287. North-Holland, Amsterdam.
6. Janson, B. N., Buckles, L. S. and Peterson, B. E. (1991) Network design programming of U.S. highway improvements. ASCE Journal of Transportation Engineering 117(4), 457-478.
7. Johnson, D. S., Lenstra, J. K. and Rinnooy Kan, A. H. G. (1978) The complexity of the network design problem. Networks 8(4), 279-285.
8. Kim, T. J., Park, C.-H. and Rho, J. H. (1985) Modeling investment priorities for national road investments: a case study of Korea. Papers of The Regional Science Association 57, 91-105.
9. LeBlanc, L. J. (1975) An algorithm for the discrete network design problem. Transportation Science 9(2), 183-199.
10. 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. Transportation Research Part B 20(3)), 259-265.
11. Magnanti, T. L. and Wong, R. T. (1984) Network design and transportation planning: models and algorithms. Transportation Science 18(1), 1-55.
12. Minoux, M. (1989) Network synthesis and optimum network design problems: models, solution methods and applications. Networks 19, 313-360.
13. Murchland, J. D. (1970) A fixed matrix for all shortest distances in a directed graph and for the inverse problem. Doctoral thesis, University of Karlsruhe.
14. Peterson, B. E. (1992) Description of the National Highway Planning Network. Oak Ridge National Laboratory, Oak Ridge.
15. Poorzahedy, H. and Turnquist, M. A. (1982) Approximate algorithms for the discrete network design problem. Transportation Research Part B 16(1), 45-55.
16. Rothengatter, W. (1986) Scheduling of interstate road and rail investments. Environment and Planning 18A, 465-483.
17. U. S. Department of Commerce (1992), County Projections to 2040 (data diskettes). Economics and Statistics Administration, Bureau of Economic Analysis, Regional Economic Analysis Division, Washington, DC.
18. Zipkin, P. H. (1980) Bounds for aggregating nodes in network problems. Mathematical Programming 19, 155-177.