8.交通地理与经济发展(Transportation).pptVIP

Computing Network Distance and Time label setting algorithm by Dijkstra (1959) valued-graph (or L-matrix) method NODEDISTANCE command in ArcInfo computes distances between nodes on the network label setting algorithm L-matrix method Street centrality measures Closeness CC how close a node is to all the other nodes along the shortest paths of the network Betweenness CB how often a node is traversed by the shortest paths connecting all pairs of nodes in the network Straightness CS how much the shortest paths from a node to all others deviate from the straight lines connecting them Centrality values at nodes * (1) scattered ports; (2) connections established; (3) interconnections developed; (4) hierarchal structure (differentiated nodes and linkages). Keep the model in mind when we examine the US transport development history. 8. Transportation Geography and Development 交通地理与发展 8.1 Transportation: condition for trade交通地理的重要意义：贸易的条件 If price differential between regions i and j is Ui-Vj, the trade can be realized only if Tij Ui-Vj. Cheaper transportation costs over time strengthened regional specialization trade 8.2 Transport costs 交通成本构成 Two components: terminal cost: fixed (FC) line-haul costs: t*d TC = FC+t*d Implications in industrial location Firms tend to locate in the raw-material site or market site to save loading/unloading costs. Transshipment cost makes the break-of-bulk location where transshipment between different transportation modes advantageous. Impact on industry III The steel industry and the break-of-bulk location 8.3 Specified markets by various modes不同运输模式的专有市场 Competition strategy: rate umbrella The rail system practiced it to attract long-haul business The rise of trucking business “predatory pricing” Transport development model Taaffe, Morrill and Gould, 1963 (Geographical Review 53, 503-529) Scattered ports; Penetration lines; Feeder lines; Interconnections developed; Hierarchal structure (differentiated nodes and linkages). Four