摘要
在对行车调整问题进行分析的基础上,结合数据挖掘技术,采用决策树的方法,以寻找连带晚点时间总和最小的调整策略为目标,对以往积累的与运行图相关的数据资源进行分析重构,寻找各故障模式下较优的行车调整策略,并对数据挖掘模型的运行机制进行了论述。该模型在实验室中得到了应用,并取得了良好的效果。
Through analyzing the problem of re-scheduling, we adopt a cteeasmn tree meu^ou ~ data mining theory to figure out optimum strategies of traffic rescheduling under various failure modes with minimum total time of knock-on delay as an goal by analyzing and reconstructing the history data re- sources related to train diagram. Furthermore, we explore the operating mechanism of the data mining model, which has been applied in our lab and achieved good effects.
出处
《铁道通信信号》
2014年第1期8-12,共5页
Railway Signalling & Communication
关键词
数据挖掘
行车调整
决策树
运行图
Data Mining
Re-scheduling
Decision Tree
Train Graph
