1 / 36

Topic 9: Network and Dynamic Segmentation

Topic 9: Network and Dynamic Segmentation. 第九讲 网络和动态分段. 16.1 Introduction 引言 16.2 Network 网络 16.2.1 Link Impedance 链路阻抗 16.2.2 Turn Impedance 转弯阻抗 16.2.3 One-way or Closed Streets 单行道或封闭的道路 16.2.4 Overpasses and Underpasses 天桥和地下通道

ulfah
Télécharger la présentation

Topic 9: Network and Dynamic Segmentation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Topic 9: Network and Dynamic Segmentation 第九讲 网络和动态分段

  2. 16.1 Introduction 引言 16.2 Network 网络 16.2.1 Link Impedance 链路阻抗 16.2.2 Turn Impedance 转弯阻抗 16.2.3 One-way or Closed Streets 单行道或封闭的道路 16.2.4 Overpasses and Underpasses 天桥和地下通道 16.2.5 Putting Together a Street Network 组合街道网络 16.3 Network Applications 网络应用 16.3.1 Shortest-Path Analysis 最短路径分析 16.3.2 Closest Facility 最近设施 16.3.3 Allocation 配置 16.3.4 Location-allocation 定位与配置 16.3.5 Urban Transportation Planning Model 城市交通规划模型

  3. 16.4 Dynamic Segmentation 动态分段 16.4.1 Create Routes on New Arcs 在新弧段上建立路径 16.4.2 Create Routes on Existing Arcs 在现有弧段上建立路径 16.4.3 Create Different Types of Routes 建立不同类型的路径 16.4.4 Create Routes with Measured Polylines 用 Measured Polylines Shapfiles 建立路径 16.5 Event Tables 事件表 16.5.1 Use Point or Polygon Coverages to Prepare Event Tables 用点或多边形图层制备事件表 16.5.2 Prepare Event Tables as INFO Files 事件表制备为 INFO 文件 16.6 Applications of Dynamic Segmentation 动态分段的应用 16.6.1 Data Query with Events 用事件进行数据查寻 16.6.2 Data Analysis with Routes and Events 用路径和事件进行数据分析

  4. Applications: 应用 Task 1: Find Best Route 查找最佳路径 Task 2: Find Closest Facility 查找最近设施 Task 3: Find Service Area 查找服务范围 Task 4: Display Point Events on a Route System in ArcView 在ArcView 中显示道路系统的点事件

  5. Possible turns at an intersection with four street segments. No U turns are allowed in this example.

  6. First Ave E. Oak St. W. Oak St. First Ave. crosses Oak St. with an overpass. A non-planar representation with no nodes is used at the intersection of Oak St. and First Ave.

  7. Street Name F-elev T-elev First Ave 0 1 First Ave 1 0 W. Oak St. 0 0 E. Oak St. 0 0 First Ave E. Oak St. W. Oak St. First Ave crosses Oak St with an overpass. A planar representation with two nodes is used at the intersection: one for First Ave, and the other for Oak St. The elevation value of 1 shows that the overpass is along First Ave.

  8. node# arc1# arc2# angle minutes 341 503 467 90 0.500 341 503 466 0 0.250 341 503 465 -90 0.250 341 467 503 -90 0.250 341 467 466 90 0.500 341 467 465 0 0.250 341 466 503 0 0.250 341 466 467 -90 0.250 341 466 465 90 0.500 341 465 503 90 0.500 341 465 467 0 0.250 341 465 466 -90 0.250 466 465 467 341 503 Possible turns at node 341

  9. node# arc1# arc2# angle minutes 265 339 342 -87.412 0.000 265 339 340 92.065 0.000 265 339 385 7.899 0.000 265 342 339 87.412 0.500 265 342 340 -0.523 0.250 265 342 385 -84.689 0.250 265 340 339 -92.065 0.250 265 340 342 0.523 0.250 265 340 385 95.834 0.500 265 385 339 -7.899 0.000 265 385 342 84.689 0.000 265 385 340 -95.834 0.000 385 342 340 265 339 Turn impedance values for turns at node 265 that has stop signs for the east-west traffic

  10. node# arc1# arc2# angle minutes 339 467 501 90.190 0.500 339 467 462 1.152 0.250 339 467 461 -92.197 -1.000 339 462 501 -90.962 0.250 339 462 467 -1.152 0.250 339 462 461 86.651 -1.000 339 461 501 2.386 0.250 339 461 467 92.197 0.500 339 461 462 -86.651 0.250 461 462 467 339 501 Turn impedance values for turns at node 339. Node 339 is an intersection between a southbound one-way street and an east-west two-way street.

  11. Six cities on a road network for shortest-path analysis

  12. Shortest path from a street address in Moscow, Idaho to its closest fire station (shown by the square symbol)

  13. Service areas of two fire stations within a 2-minute response time in Moscow, Idaho

  14. Service areas of two fire stations within a 5-minute response time in Moscow, Idaho

  15. Demand points in Latah County, Idaho for a public library location problem

  16. Three candidates selected by the maximum covering model and the demand points served by the candidates

  17. Three candidates selected by the minimum distance model and the demand points served by the candidates

  18. One fixed and two selected candidates using the minimum distance model with the maximum distance constraint of 10 miles. The fixed candidate is the one to the west.

  19. Interstate highways in Idaho

  20. A bus route with two loops

  21. Because the bus route is a looping route, the route system is dissected into three sections.

  22. Bus stops along the bus route

  23. A stream route system and a slope coverage with four slope classes

  24. The linking of an event table (a), a route table (b), and a section table

  25. This map displays the result from querying the event table (Year <= 1990)

  26. This map displays the first 50-mile segment of Interstates 15, 84, 86, and 90

  27. (1) (2) (3) (4) (5) (6) (1) 0 20 53 58 0 0 (2) 20 0 39 0 0 0 (3) 53 39 0 25 0 19 (4) 58 0 25 0 13 0 (5) 0 0 0 13 0 13 (6) 0 0 19 0 13 0 Table 16.1 The impedance matrix among 6 nodes

  28. From-node To-node Shortest Path Minimum Cumulative impedance 1 2 p12 20 1 3 p13 53 1 4 p14 58 1 5 p14 + p45 71 1 6 p13 + p36 72 Table 16.2 Shortest paths from node 1 to all other nodes

  29. inter# inter-id high_number 1 1 15 2 2 84 3 3 86 4 4 90 5 5 184 Table 16.3 The route table for the interstates in Idaho

  30. routelink# arclink# f-meas t-meas f-pos t-pos inter# inter-id 1 5 0 44700 100 0 1 1 1 4 44700 123648 100 0 2 2 1 3 123648 199791 100 0 3 3 1 16 199791 239375 100 0 4 4 1 15 239375 315194 100 0 5 5 2 6 0 74024 0 100 6 6 2 7 74024 78964 0 100 7 7 2 9 78964 154873 0 100 8 8 2 10 154873 226153 0 100 9 9 2 11 226153 303050 0 100 10 10 2 12 303050 356992 0 100 11 11 2 17 356992 433769 0 100 12 12 2 18 433769 443570 0 100 13 13 3 13 0 78065 0 100 14 14 3 14 78065 101154 0 100 15 15 4 1 0 72033 0 100 16 16 4 2 72033 117974 0 100 17 17 5 8 0 6348 100 0 18 18 Table 16.4 The section table for the interstates in Idaho

  31. usstations# bus# measure 1 1 899.930 2 1 2359.145 3 1 2476.239 4 1 2849.655 5 1 3163.485 6 1 4173.557 7 1 5446.844 8 1 6451.580 9 1 9368.944 10 1 8509.497 11 1 10002.686 12 1 10412.696 13 1 11728.987 Table 16.5 A point event table showing bus stops along the bus route

  32. Table 16.6 A linear event table showing slope-code along a stream route (Emida-ID = 1)

  33. inter-id from to year 1 44700 90000 1995 1 123648 180000 1989 1 239375 270000 1992 2 74024 78000 1988 2 154873 180000 1993 2 356992 400000 1987 3 78065 90000 1988 4 40000 72033 1986 Table 16.7 A linear event table showing year of pavement re-surfacing on the interstate highway route system

  34. inter-id to unit 1 80465 1 1 160930 2 1 241395 3 1 315194 4 2 80465 1 2 160930 2 2 241395 3 2 321860 4 2 402325 5 2 443570 6 3 80465 1 3 101155 2 4 80465 1 4 117974 2 Table 16.8 A continuous event table dividing each interstate highway into 50-mile segments

  35. Thank You !

More Related