论文信息 - Optimal Transportation Networks: A Case Study of Highway Systems

Optimal Transportation Networks: A Case Study of Highway Systems

This paper outlines some combinatorial approaches to the optimal synthesis of transportation networks. As an example, the inter-urban multi-lane highway network of Southern Ontario and Quebec is studied. A number of network-building algorithms are applied to this situation, and the resulting networks compared to the actual network. Some suggestions for further research are noted.

R. D. MacKinnon | M. J. Hodgson

[1] R D Mackinnon,et al. THE HIGHWAY SYSTEM OF SOUTHERN ONTARIO AND QUEBEC: SOME SIMPLE NETWORK GENERATION MODELS , 1969 .

[2] E. Gilbert. Minimum cost communication networks , 1967 .

[3] M. Pollack. Solutions of the kth best route through a network — A review , 1961 .

[4] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .

[5] M. Beckmann. A Continuous Model of Transportation , 1952 .

[6] THE DEMAND FOR ABSTRACT TRANSPORT MODES: SOME MISGIVINGS , 1969 .

[7] R. Prim. Shortest connection networks and some generalizations , 1957 .

[8] Neufville R De,et al. OPTIMAL HIGHWAY STAGING BY DYNAMIC PROGRAMMING , 1970 .

[9] Christian Werner,et al. Networks of Minimum Length , 1969 .

[10] G. Bergendahl,et al. A COMBINED LINEAR AND DYNAMIC PROGRAMMING MODEL FOR INTERDEPENDENT ROAD INVESTMENT PLANNING , 1969 .

[11] A. Scott. The optimal network problem: Some computational procedures , 1969 .

[12] Duane F. Marble,et al. THE STRUCTURE OF TRANSPORTATION NETWORKS , 1962 .

[13] Edward K. Morlok. A goal-directed transportation planning model , 1969 .

[14] W. G. Hansen. How Accessibility Shapes Land Use , 1959 .

[15] Monroe L. Funk,et al. Optimal Construction Staging By Dynamic Programming , 1968 .