基于改进DT算法的铁路路径自动搜索方法

Automatic Search Method for Railway Route based on Improved DT Algorithm

针对传统铁路线路设计基本依赖于经验、再结合地形、地质等因素设计出最终线路空间位置,存在耗时过长且容易遗漏优秀方案等问题,文章引入DT算法并对其改进。首先将整个选线研究范围视为一张规则格网图像,然后重点对DT搜索方法中格网遍历规则、邻域模板、距离算法和路径连接方法进行改进,实现依据选线参数,快速、全面获取可行走廊带,搜索可行路径方案群,对指导线路方案研究及提高设计效率与质量具有重大意义。

At present, designing railway alignment to get the Final space position mainly depends on knowledge and experience of the engineers, combining with topographic and geologic condition, which has defects such as more labour work and easy to miss the excellent schemes. In this paper, we introduce the improved DT algorithm. First, the whole line selection area is considered as a regular distance algorithm and path connection method is obtained quickly and comprehensively and th grid image, and then in the DT search meth e feasible route scheme guide the line scheme the grid traversal rule neighborhood template, od are improved. At last the feasible cmTid group is searched on the basis of the line schemem research and improve the design efficiency