求选编钩计划最优下落方案的一种最短路算法

在铁路车站调车作业计划中,车列的不同下落方案直接影响选编钩计划的溜放钩数目。车列的不同下落方案实质上是调车后车组在车列中的排列顺序不同。求调车后车组的最优排列顺序问题可以转化为求一个有向图的最小Hamilton路问题,由于车列具有站顺的要求,因此利用所求Hamilton路的这一特性,可以将求最小Hamilton路问题转化为求一个有向图的最短路问题,从而得到求解车列最优下落方案的一个有效方法。

A Shortest-path Algorithm for the Optimum of the Fall-down Plan of Wagon Groups

In railway stations,when making shunting operation plan,the quantity of sliding hooks depends on the fall-down plan of wagon groups.And the fall-down plan,essentially,depends on the rank of wagon group after being shunted.Seeking the optimum rank of wagon group after being shunted can be converted to finding the shortest-Hamilton path in a directed graph.Because of shunting requirement,this Hamilton path problem has its own feature in the directed graph.Therefore,it is also can be convert to a shortest-path...