首页> 外文期刊>International journal of systems assurance engineering and management >Clustering and association rules in analyzing the efficiency of maintenance system of an urban bus network
【24h】

Clustering and association rules in analyzing the efficiency of maintenance system of an urban bus network

机译:聚类和关联规则在分析城市公交网络维护系统效率中的作用

获取原文
获取原文并翻译 | 示例
       

摘要

Maintenance has always been considered as an important part of both manufacturing and service systems and yet a costly practice. The purpose of this study is to analyze the efficiency of the maintenance activities in a maintenance system comprising of independent components, using the collected data in process. For this purpose, a three-stage method was followed. First, at the initial data preprocessing stage, after the data purification, new operating fields were defined. The data was integrated in a final matrix which was used as an input for the modeling phase. At this stage, using one of the clustering algorithms i.e. k-means, the maintenance data was clustered so that homogenous clusters of the components i.e. buses, were formed. Then using the Euclidean distance, the distances of the clusters from the ideal status were found and clusters were categorized and named accordingly. In the last part of the modeling stage, while having the clusters as target, Apriori algorithm was used to identify the rules (conditions) which had caused each record to be placed in each specific cluster and thereby to find a way to assess the efficiency of the maintenance system and activities. At the 3rd stage and on the basis of the extracted rules, necessary steps were proposed to eliminate the conditions which lead records to be placed in the clusters comprising records of bad conditions. The method is explained in a case study of the maintenance system of an urban transportation bus network.
机译:维护一直被视为制造和服务系统的重要组成部分,但却是一项昂贵的实践。这项研究的目的是使用过程中收集的数据来分析由独立组件组成的维护系统中维护活动的效率。为此目的,采用了三阶段方法。首先,在初始数据预处理阶段,在数据净化之后,定义了新的操作字段。将数据整合到最终矩阵中,该矩阵用作建模阶段的输入。在这一阶段,使用一种聚类算法,即k-means,对维护数据进行聚类,从而形成部件即总线的同质聚类。然后使用欧几里得距离,找到聚类与理想状态之间的距离,并对聚类进行分类和命名。在建模阶段的最后部分,以聚类为目标时,使用Apriori算法来识别导致将每个记录放置在每个特定聚类中的规则(条件),从而找到一种评估聚类效率的方法。维护系统和活动。在第3阶段并根据提取的规则,提出了必要的步骤来消除导致将记录放入包含不良条件的记录的群集中的条件。在城市交通客车网络维护系统的案例研究中说明了该方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号