網絡和動態(tài)分段PPT課件

1、1topic 9: network and dynamic segmentation 第九講 網絡和動態(tài)分段網絡和動態(tài)分段2316.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 networ

2、k 組合街道網絡組合街道網絡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 城市交通規(guī)劃模型城市交通規(guī)劃模型416.4 dynamic segmentation 動態(tài)分段動態(tài)分段 16.4.1 create routes on

3、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

4、 event tables 用點或多邊形圖層制備事件表用點或多邊形圖層制備事件表16.5.2 prepare event tables as info files 事件表制備為事件表制備為 info 文件文件16.6 applications of dynamic segmentation 動態(tài)分段的應用動態(tài)分段的應用16.6.1 data query with events 用事件進行數據查尋用事件進行數據查尋16.6.2 data analysis with routes and events 用路徑和事件進行數據分析用路徑和事件進行數據分析5applications: 應用應用 task

5、 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 中顯示道路系統的點事件中顯示道路系統的點事件6 possible turns at an intersection with four street segments. no u turns are allowed in this exam

6、ple. 7w. oak st.e. oak st.first ave 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. 8w. oak st.e. oak st.first ave street namef-elevt-elevfirst ave01first ave10w. oak st.00e. oak st.00first ave crosses oak s

7、t 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. 9341 466503467465node#arc1#arc2#angleminutes341503467900.50034150346600.250341503465-900.250341467

8、503-900.250341467466900.50034146746500.25034146650300.250341466467-900.250341466465900.500341465503900.50034146546700.250341465466-900.250 possible turns at node 341 10265385339340342node#arc1#arc2#angleminutes265339342-87.4120.00026533934092.0650.0002653393857.8990.00026534233987.4120.500265342340-

9、0.5230.250265342385-84.6890.250265340339-92.0650.2502653403420.5230.25026534038595.8340.500265385339-7.8990.00026538534284.6890.000265385340-95.8340.000 turn impedance values for turns at node 265 that has stop signs for the east-west traffic 11 461501462339467node#arc1#arc2#angleminutes33946750190.

10、1900.5003394674621.1520.250339467461-92.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

11、-way street. 12six cities on a road network for shortest-path analysis 13shortest path from a street address in moscow, idaho to its closest fire station (shown by the square symbol) 14service areas of two fire stations within a 2-minute response time in moscow, idaho 15service areas of two fire sta

12、tions within a 5-minute response time in moscow, idaho 16demand points in latah county, idaho for a public library location problem 17three candidates selected by the maximum covering model and the demand points served by the candidates 18three candidates selected by the minimum distance model and t

13、he demand points served by the candidates 19one 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. 20interstate highways in idaho 21a bus route with two loops 22because the bus route is a lo

14、oping route, the route system is dissected into three sections. 23bus stops along the bus route24a stream route system and a slope coverage with four slope classes 25the linking of an event table (a), a route table (b), and a section table 26this map displays the result from querying the event table

15、 (year = 1990)27this map displays the first 50-mile segment of interstates 15, 84, 86, and 90 28 (1)(2)(3)(4)(5)(6)(1)020535800(2)20039000(3)5339025019(4)580250130(5)00013013(6)00190130 table 16.1 the impedance matrix among 6 nodes 29 from-nodeto-nodeshortest pathminimum cumulative impedance12p12201

16、3p135314p145815p14 + p457116p13 + p3672 table 16.2 shortest paths from node 1 to all other nodes 30 inter#inter-idhigh_number111522843386449055184 table 16.3 the route table for the interstates in idaho 31routelink#arclink#f-meast-measf-post-posinter#inter-id15044700100011144470012364810002213123648

17、199791100033116199791239375100044115239375315194100055260740240100662774024789640100772978964154873010088210154873226153010099211226153303050010010102123030503569920100111121735699243376901001212218433769443570010013133130780650100141431478065101154010015154107203301001616427203311797401001717580634

18、810001818 table 16.4 the section table for the interstates in idaho 32usstations#bus#measure11899.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 route 33table 16.6 a linear event table showing slope-code along a stream ro