...
首页> 外文期刊>Mathematical Theory and Modeling >An Assessment of Accessibility and Connectivity of Some Important Places in Kolhapur City of Maharashtra: A Road Network Analysis
【24h】

An Assessment of Accessibility and Connectivity of Some Important Places in Kolhapur City of Maharashtra: A Road Network Analysis

机译:马哈拉施特拉邦科尔哈普尔市一些重要场所的可达性和连通性评估:道路网络分析

获取原文

摘要

There are various methods to find out the accessibility and connectivity of road networks. The method that used to determine the accessibility and connectivity is quantitative or qualitative; sometime it includes both quantitative and qualitative aspects of transportation network. The degree to which any place is served by transportation network (on which it stands) defines the accessibility of that place. And the connectivity is the ratio between total number of arcs and total number of nodes in transportation network. The connectivity is directly proportional to the total number of arcs and inversely proportional to the total number of nodes. If the degree of connectivity within a transportation network is higher; then it means that transportation system will be more efficient. Therefore, the present paper attempts to access the accessibility and connectivity of road networks in Kolhapur city. The accessibility of study area is determined by the shortest path matrix. The connectivity is determined by the beta (?) index given by K.J. Kansky. After analyzing the accessibility and connectivity of study area, easily accessible and shortest paths are also suggested in order to reach the important centers very easily.
机译:有多种方法来查找道路网络的可访问性和连通性。用于确定可访问性和连通性的方法是定量的或定性的。有时它包括交通网络的定量和定性方面。交通网络(其所处的位置)对任何地方提供服务的程度定义了该地方的可访问性。连接性是弧形总数与运输网络中节点总数之比。连接性与弧的总数成正比,与节点的总数成反比。如果运输网络内的连通度更高;那么这意味着运输系统将更加高效。因此,本文试图访问科尔哈普尔市道路网络的可访问性和连通性。学习区的可达性由最短路径矩阵决定。连通性由K.J.坎斯基在分析研究区域的可达性和连通性之后,还建议了易于到达和最短的路径,以便非常轻松地到达重要的中心。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号