首页> 外文会议>Transportation Research Board Annual meeting >CLUSTERING OF PAVEMENT STRETCHES AND FINDING OUT THE OPTIMUM NUMBER OF CLUSTERS FOR PAVEMENT MAINTENANCE
【24h】

CLUSTERING OF PAVEMENT STRETCHES AND FINDING OUT THE OPTIMUM NUMBER OF CLUSTERS FOR PAVEMENT MAINTENANCE

机译:摊铺摊铺机的群集和查找摊铺保养的最佳数量

获取原文

摘要

When a large number of pavement stretches are to be maintained, the decision making becomescomplicated and prioritization of individual stretches is not much useful in taking maintenancemanagement decisions. In such situations grouping or clustering the pavement stretches havingsimilar distress characteristics would be the practical and effective approach. Since a number ofdistresses are observed on pavements and usually they are being represented in different levelsof severity and extent it becomes quite difficult to cluster them. The problem becomes furtheraggravated as the weights of various distresses also play an important role and it is difficult toexpress them objectively. A methodology has been suggested in this paper on the clustering ofpavement stretches and also to find out the optimum number of clusters. The technique has beenexplained with the help of a case study carried out in a few selected stretches in the state ofRajasthan, India.
机译:当要保持大量的人行道伸展时,决策就变成了 各个拉伸段的复杂性和优先级在维护方面没有太大用处 管理决策。在这种情况下,将人行道延伸分组或成簇 类似的遇险特征将是切实有效的方法。由于一些 在人行道上观察到遇险,并且通常以不同的水平来表示 从严重程度和程度来看,将它们聚类变得非常困难。问题变得更加严重 由于各种遇险者的权重也起着重要作用,因此加剧 客观地表达出来。本文提出了一种关于聚类的方法 人行道伸展,并找出最佳的簇数。该技术已经 在案例研究的帮助下进行了一些解释,这些案例是在以下情况下进行的: 印度拉贾斯坦邦。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号