基于排序二叉树的摘挂列车编组钩计划自动编制方法

Automatic Compilation Method for Marshalling Coupler Plan of Trains Detaching and Attaching Based on Binary Search Tree

根据摘挂列车编组调车作业原理,将摘挂列车下落问题抽象为排序问题,提出一种基于排序二叉树的编组钩计划自动编制方法。根据待编列车序列构造排序二叉树;利用排序二叉树的有序性快速搜索出有序车组序列,将其作为下落方案的可选集。考虑邻组、暂合列内收编固定组组别和空闲组别、端组等因素,从可选集中筛选出较优的下落方案。通过定义收编固定组简化列车收编过程,实现列车收编过程的计算机自动编制。通过实例验证,采用该方法降低了选择下落方案的复杂性,减少了列车编组钩计划的调车钩数,而且可根据实际调车线数灵活调整方案。

According to the principle of classification shunting operations of trains, train detaching and attaching fall-down problem is abstracted as a sequencing problem, and a method for automatically generating marshalling coupler plan is presented based on binary search tree. A binary search tree, which is applied to the sequence of trains waiting to be marshaled, is built. By its feature of orderliness, the sequence arrays are searched quickly and are used as the selectable sets of fall-down plans. Considering such factors as adjacent wagon group, the fixed wagon group of the temporary merging train set in the merging process, idle wagon group and end wagon group, better fall-down plans can be chosen from the selectable sets. A new definition of take-in marshalling fixed group is introduced to simplify the take-in marshalling process by using computer. Examples verify that the proposed method can reduce the complexity of selecting fall-down plan, save the shunting hooks in marshalling coupler plan and flexibly adjust the plan according to the actual number of shunting tracks.