Worldwide, rural road networks serve a vital link in the chain leading goods to markets and people to places. The efficiency of rural road network services is influenced by road-related investment and policy decisions. Reaching good decisions, however, is complicated by: interrelationships among policy, investment, road use, road performance, and rural economies; and combinatorial challenges involving the distribution of discrete policy and investment arrangements across networks.</p><p>The main objective of this study is to address this complex problem as it pertains to rural road networks in Saskatchewan. Rural roads in Saskatchewan are suffering under increasing volumes of heavy truck traffic motivated principally by recent changes in the grain handling and transportation system. To address this problem, Saskatchewan Department of Highways and Transportation is considering a range of haul policy and road structure investment options. The question is, what (spatial) arrangement of available policy and investment options best meets this challenge. </p><p>To answer this question, a cost-based standard is incorporated within a network design modeling approach and solved using custom algorithmic strategies. Applied to a case study network, the model determines a demonstrably good arrangement of costly road structure modifications under each considered policy option. Resulting policy-investment combinations are subsequently ranked according to total cost and equivalent net benefit standards. </p><p>A number of important findings emerge from this analysis. Policy and investment decisions are linked; spatial arrangement of road structure modifications is contingent on the haul policy regime in place. Road performance and use characteristics are indeed sensitive to policy and investment decisions. Optimal budget levels computed by the model contradict perceptions that rural road networks in Saskatchewan are grossly under-funded. Despite best intentions, ill-considered policy can actually reduce the net benefits of road provision and use. </p><p> Model application and design limitations suggest promising avenues for future research. These include: model larger networks in Saskatchewan and beyond; determine optimal road budgets under benefit-cost standards reflecting competing economic needs; employ model within regional economic planning investigations to forecast road-related implications; and model policy endogenously to aid design of heavy haul sub-networks and to address questions concerning network expansion or contraction.
Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:SSU.etd-01132006-204432 |
Date | 13 January 2006 |
Creators | Christensen, Paul Normann |
Contributors | Srinivasan, Raj, Sparks, Gordon A., Pufahl, Dennis E., Nolan, James F., Hildebrand, Eric, Berthelot, Curtis, Stabler, Jack C. |
Publisher | University of Saskatchewan |
Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
Language | English |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | http://library.usask.ca/theses/available/etd-01132006-204432/ |
Rights | unrestricted, I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to University of Saskatchewan or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. |
Page generated in 0.4204 seconds