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.
Get full access to this article
View all access options for this article.
References
1.
BeckmannM. J., 1952, “A continuous model of transportation”, Econometrica, 20, 643–660.
2.
BeckmannM. J., 1967, “Principles of optimal location for transportation networks”, in Quantitative Geography: Part I, Eds. GarrisonW. L. and MarbleD. F. (Northwestern University Press, Evanston, Illinois), pp. 95–119.
3.
BergendahlG., 1969, “A combined linear and dynamic programming model for interdependent road investment planning”, Transportation Research, 3, 211–228.
4.
BlackW., 1967, “Growth of the railway network of Maine: A multivariate approach”, Department of Geography, University of Iowa, Discussion Paper number 5.
5.
BlackW., 1968, “An iterative model for generating transportation networks”, mimeo, Miami University, Florida.
6.
BoyceD. E., 1963, The Generation of Synthetic Transportation Networks, US Army Transportation Research Command, DA 44–177-TC-685, Fort Eustis, Virginia.
7.
de NeufvilleR.MoriY., 1970, “Optimal highway staging by dynamic programming”, ASCE Transportation Engineering Journal, 96, 11–24.
8.
EdwardsA. L., 1967, Statistical Methods, 2nd edition (Holt, Rinehart and Winston, New York).
9.
FunkM. L.TillmanF. A., 1968, “Optimal construction staging by dynamic programming”, ASCE Journal of the Highway Division, 94, 255–265.
10.
GilbertE. N., 1967, “Minimum cost communication networks”, Bell System Technical Journal, 46, 2209–2227.
GronauR.AcalyR. E., 1968, “The demand for abstract transport modes: Some misgivings”, Journal of Regional Science, 9, 153–157.
13.
HansenW. G., 1959, “How accessibility shapes land use”, Journal of the American Institute of Planners, 25, 73–76.
14.
HodgsonM. J., 1969, “Highway link addition model for southwestern Ontario”, Research Report number 19, Centre for Urban and Community Studies, University of Toronto, Ontario.
15.
KanskyK. J., 1963, Structure of Transportation Networks, Research Paper number 84, Department of Geography, University of Chicago, Illinois.
16.
LinS., 1965, “Computer solutions to the travelling salesman problem”, Bell System Technical Journal, 44, 2245–2270.
17.
MacKinnonR. D., 1969, “Dynamic programming and geographical systems”, Research Report number 13, Centre for Urban and Community Studies, University of Toronto, Ontario.
18.
MacKinnonR. D.HodgsonM. J., 1969, “The highway system of southern Ontario and Quebec: Some simple network-generation models”, Research Report number 18, Centre for Urban and Community Studies, University of Toronto, Ontario.
19.
MorlokE. K., 1969, “A goal-directed transportation planning model”, Research Report, Transportation Centre at Northwestern University, Evanston, Illinois.
20.
PollakM., 1961, “Solution of the kth best route through a network: A review”, Journal of Mathematical Analysis and Applications, 3, 547–559.
21.
PrimR., 1957, “Shortest connection networks and some generalizations”, Bell System Technical Journal, 36, 1389–1401.
22.
SchwartzJ. G., 1968, “Network flow and synthesis models for transportation planning: A survey”, Search and Choice in Transport Systems Planning, 10, MITCambridge, Mass.
23.
ScottA. J., 1969, “The optimal network problem: Some computational procedures”, Transportation Research, 3, 201–210.
24.
WernerC., 1969, “Networks of minimum length”, The Canadian Geographer, 13, 47–69.
