如果您无法下载资料,请参考说明:
1、部分资料下载需要金币,请确保您的账户上有足够的金币
2、已购买过的文档,再次下载不重复扣费
3、资料包下载后请先用软件解压,在使用对应软件打开
会计学/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中显示道路系统的点事件341265Sixcitiesonaroadnetworkforshortest-pathanalysisShortestpathfromastreetaddressinMoscow,Idahotoitsclosestfirestation(shownbythesquaresymbol)Serviceareasoftwofirestationswithina2-minuteresponsetimeinMoscow,IdahoServiceareasoftwofirestationswithina5-minuteresponsetimeinMoscow,IdahoDemandpointsinLatahCounty,IdahoforapubliclibrarylocationproblemThreecandidatesselectedbythemaximumcoveringmodelandthedemandpointsservedbythecandidatesThreecandidatesselectedbytheminimumdistancemodelandthedemandpointsservedbythecandidatesOnefixedandtwoselectedcandidatesusingtheminimumdistancemodelwiththemaximumdistanceconstraintof10miles.Thefixedcandidateistheonetothewest.InterstatehighwaysinIdahoAbusroutewithtwoloopsBecausethebusrouteisaloopingroute,theroutesystemisdissectedintothreesections.BusstopsalongthebusrouteAstreamroutesystemandaslopecoveragewithfourslopeclassesThelinkingofaneventtable(a),aroutetable(b),andasectiontableThismapdisplaysth