地理信息系统导论chap17.ppt

Figure 17.13 Service areas of two fire stations within a 5-minute response time. Location-Allocation Location–allocation solves problems of matching the supply and demand by using sets of objectives and constraints. Figure 17.14 The two solid squares represent existing fire stations, the three open squares candidate facilities, and the seven circles nursing homes. The map shows the result of matching two existing fire stations with nursing homes based on the minimum impedance model and an impedance cutoff of 4 minutes on the road network. Figure 17.15 The map shows the result of matching three fire stations, two existing ones and one candidate, with seven nursing homes based on the minimum impedance model and an impedance cutoff of 4 minutes on the road network. Figure 17.16 The map shows the result of matching three fire stations, two existing ones and one candidate, with seven nursing homes based on the minimum impedance model and an impedance cutoff of 5 minutes on the road network. TIGER/Line files /geo/www/tiger/ * Chapter 17 LEAST-COST PATH ANALYSIS AND NETWORK ANALYSIS 17.1 Least Cost Path Analysis 17.1.1 Source Raster 17.1.2 Cost Raster Box 17.1 Cost Raster for a Site Analysis of Pipelines 17.1.3 Cost Distance Measures 17.1.4 Deriving the Least Accumulative Cost Path Box 17.2 Derivation of the Least Accumulative Cost Path 17.1.5 Options for Least Cost Path Analysis Box 17.3 Least-Cost Path Analysis for Studies of Food Deserts 17.2 Applications of Least Cost Path Analysis 17.3 Network 17.3.1 Link and Link Impedance 17.3.2 Junction and Turn Impedance 17.3.3 One-Way or Closed Streets 17.3.4 Overpasses and Underpasses 17.4 Putting Together a Network 17.4.1 Gathering Linear Features 17.4.2 Editing and Building Network Box 17.4 Network Dataset 17.4.3 Attributing the Network Features Box 17.5 Road Networks from the TIGER/Line Files 17.5 Network Analysis 17.5.1 Shortest Path Analysis 17.5.2 Traveling Salesman Problem 17.5.3 Vehicle Routing Problem 17.5.4 Closest