《网络和动态分段PPT课件》由会员分享，可在线阅读，更多相关《网络和动态分段PPT课件（36页珍藏版）》请在金锄头文库上搜索。
1、Topic9: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 天桥和地下通道天桥和地下通道16.2.5 Putting Together a Street Network 组合街
2、道网络组合街道网络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 城市交通规划模型城市交通规划模型16.4 Dynamic Segmentation 动态分段动态分段 16.4.1 Create Routes on New Ar
3、cs 在新弧段上建立路径在新弧段上建立路径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
4、 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 用路径和事件进行数据分析用路径和事件进行数据分析Applications: 应用应用 Task 1: Fin
5、d Best Route 查找最佳路径查找最佳路径Task 2: Find Closest Facility 查找最近设施查找最近设施Task 3: Find Service Area 查找服务范围查找服务范围Task 4: Display Point Events on a Route System in ArcView 在在ArcView 中显示道路系统的点事件中显示道路系统的点事件Possible turns at an intersection with four street segments. No U turns are allowed in this example. W.Oa
6、kSt.E.OakSt.FirstAveFirst 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. W.OakSt.E.OakSt.FirstAveStreet NameF-elevT-elevFirstAve01FirstAve10W.OakSt.00E.OakSt.00First Ave crosses Oak St with an overpass. A planar
7、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. 341466503467465node#arc1#arc2#angleminutes341503467900.50034150346600.250341503465-900.250341467503-900.250341467466900.5003414
8、6746500.25034146650300.250341466467-900.250341466465900.500341465503900.50034146546700.250341465466-900.250Possible turns at node 341 265385339340342node#arc1#arc2#angleminutes265339342-87.4120.00026533934092.0650.0002653393857.8990.00026534233987.4120.500265342340-0.5230.250265342385-84.6890.250265
9、340339-92.0650.2502653403420.5230.25026534038595.8340.500265385339-7.8990.00026538534284.6890.000265385340-95.8340.000Turn impedance values for turns at node 265 that has stop signs for the east-west traffic 461501462339467node#arc1#arc2#angleminutes33946750190.1900.5003394674621.1520.250339467461-9
10、2.197-1.000339462501-90.9620.250339462467-1.1520.25033946246186.651-1.0003394615012.3860.25033946146792.1970.500339461462-86.6510.250Turn 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. Six cities on a road netw
11、ork for shortest-path analysis Shortest path from a street address in Moscow, Idaho to its closest fire station (shown by the square symbol) Service areas of two fire stations within a 2-minute response time in Moscow, Idaho Service areas of two fire stations within a 5-minute response time in Mosco
12、w, Idaho Demand points in Latah County, Idaho for a public library location problem Three candidates selected by the maximum covering model and the demand points served by the candidates Three candidates selected by the minimum distance model and the demand points served by the candidates One fixed
13、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. Interstate highways in Idaho A bus route with two loops Because the bus route is a looping route, the route system is dissected into three sectio
14、ns. Bus stops along the bus routeA stream route system and a slope coverage with four slope classesThe linking of an event table (a), a route table (b), and a section table This map displays the result from querying the event table (Year = 1990)This map displays the first 50-mile segment of Intersta
15、tes 15, 84, 86, and 90 (1)(2)(3)(4)(5)(6)(1)020535800(2)20039000(3)5339025019(4)580250130(5)00013013(6)00190130Table 16.1 The impedance matrix among 6 nodes From-nodeTo-nodeShortest PathMinimum Cumulative impedance12p122013p135314p145815p14+p457116p13+p3672Table 16.2 Shortest paths from node 1 to al
16、l other nodes inter#inter-idhigh_number111522843386449055184Table 16.3 The route table for the interstates in Idahoroutelink#arclink#f-meast-measf-post-posinter#inter-id15044700100011144470012364810002213123648199791100033116199791239375100044115239375315194100055260740240100662774024789640100772978
17、964154873010088210154873226153010099211226153303050010010102123030503569920100111121735699243376901001212218433769443570010013133130780650100141431478065101154010015154107203301001616427203311797401001717580634810001818Table 16.4 The section table for the interstates in Idahousstations#bus#measure11
18、899.930212359.145312476.239412849.655513163.485614173.557715446.844816451.580919368.9441018509.49711110002.68612110412.69613111728.987Table 16.5 A point event table showing bus stops along the bus routeTable 16.6 A linear event table showing slope-code along a stream route (Emida-ID = 1)Emida-IDFrom
19、ToSlope-Code107638117638779821779878231178237832217832848711848785611185618586218586863911863986432inter-idfromtoyear14470090000199511236481800001989123937527000019922740247800019882154873180000199323569924000001987378065900001988440000720331986Table 16.7 A linear event table showing year of pavement re-surfacing on the interstate highway route system inter-idtounit180465111609302124139531315194428046512160930222413953232186042402325524435706380465131011552480465141179742Table 16.8 A continuous event table dividing each interstate highway into 50-mile segments Thank You !
