《网络和动态分段》PPT课件

Topic9:NetworkandDynamicSegmentation,第九讲网络和动态分段,16.1Introduction引言16.2Network网络16.2.1LinkImpedance链路阻抗16.2.2TurnImpedance转弯阻抗16.2.3One-wayorClosedStreets单行道或封闭的道路16.2.4OverpassesandUnderpasses天桥和地下通道16.2.5PuttingTogetheraStreetNetwork组合街道网络16.3NetworkApplications网络应用16.3.1Shortest-PathAnalysis最短路径分析16.3.2ClosestFacility最近设施16.3.3Allocation配置16.3.4Location-allocation定位与配置16.3.5UrbanTransportationPlanningModel城市交通规划模型,16.4DynamicSegmentation动态分段16.4.1CreateRoutesonNewArcs在新弧段上建立路径16.4.2CreateRoutesonExistingArcs在现有弧段上建立路径16.4.3CreateDifferentTypesofRoutes建立不同类型的路径16.4.4CreateRouteswithMeasuredPolylines用MeasuredPolylinesShapfiles建立路径16.5EventTables事件表16.5.1UsePointorPolygonCoveragestoPrepareEventTables用点或多边形图层制备事件表16.5.2PrepareEventTablesasINFOFiles事件表制备为INFO文件16.6ApplicationsofDynamicSegmentation动态分段的应用16.6.1DataQuerywithEvents用事件进行数据查寻16.6.2DataAnalysiswithRoutesandEvents用路径和事件进行数据分析,Applications:应用Task1:FindBestRoute查找最佳路径Task2:FindClosestFacility查找最近设施Task3:FindServiceArea查找服务范围Task4:DisplayPointEventsonaRouteSysteminArcView在ArcView中显示道路系统的点事件,Possibleturnsatanintersectionwithfourstreetsegments.NoUturnsareallowedinthisexample.,W.OakSt.,E.OakSt.,FirstAve,FirstAve.crossesOakSt.withanoverpass.Anon-planarrepresentationwithnonodesisusedattheintersectionofOakSt.andFirstAve.,W.OakSt.,E.OakSt.,FirstAve,FirstAvecrossesOakStwithanoverpass.Aplanarrepresentationwithtwonodesisusedattheintersection:oneforFirstAve,andtheotherforOakSt.Theelevationvalueof1showsthattheoverpassisalongFirstAve.,341,466,503,467,465,Possibleturnsatnode341,265,385,339,340,342,Turnimpedancevaluesforturnsatnode265thathasstopsignsfortheeast-westtraffic,461,501,462,339,467,Turnimpedancevaluesforturnsatnode339.Node339isanintersectionbetweenasouthboundone-waystreetandaneast-westtwo-waystreet.,Sixcitiesonaroadnetworkforshortest-pathanalysis,ShortestpathfromastreetaddressinMoscow,Idahotoitsclosestfirestation(shownbythesquaresymbol),Serviceareasoftwofirestationswithina2-minuteresponsetimeinMoscow,Idaho,Serviceareasoftwofirestationswithina5-minuteresponsetimeinMoscow,Idaho,DemandpointsinLatahCounty,Idahoforapubliclibrarylocationproblem,Threecandidatesselectedbythemaximumcoveringmodelandthedemandpointsservedbythecandidates,Threecandidatesselectedbytheminimumdistancemodelandthedemandpointsservedbythecandidates,Onefixedandtwoselectedcandidatesusingtheminimumdistancemodelwiththemaximumdistanceconstraintof10miles.Thefixedcandidateistheonetothewest.,InterstatehighwaysinIdaho,Abusroutewithtwoloops,Becausethebusrouteisaloopingroute,theroutesystemisdissectedintothreesections.,Busstopsalongthebusroute,Astreamroutesystemandaslopecoveragewithfourslopeclasses,Thelinkingofaneventtable(a),aroutetable(b),andasectiontable,Thismapdisplaystheresultfromqueryingtheeventtable(Year=1990),Thismapdisplaysthefirst50-milesegmentofInterstates15,84,86,and90,Table16.1Theimpedancematrixamong6nodes,Table16.2Shortestpathsfromnode1toallothernodes,Table16.3TheroutetablefortheinterstatesinIdaho,Table16.4ThesectiontablefortheinterstatesinIdaho,Table16.5Apointeventtableshowingbusstopsalongthebusroute,Table16.6Alineareventtableshowingslope-codealongastreamroute(Emida-ID=1),Table16.7Alinear