摘要
Abstract
By taking the locomotive running time between operating points(stations)as weights,the optimiza-tion problem of placing-in and taking-out of wagons is transformed into the shortest path problem of Hamilton map under the set conditions,which can be solved by dynamic programming method and the improved Clarke-Wright saving algorithm. This paper generalizes the advantages and disadvantages of the above two algorithms with examples,providing the application scopes simultaneously. Dynamic programming method has characteristics of fewer calculation times,getting the optimal solution,possessing many alternative solutions, and it is applied to the case of small operating scale. Improved Clarke-Wright saving algorithm may get satisfac-tory solution,but it can significantly reduce the computational complexity,and it is applied to the case of larg-er scale. The three kind of arrangement forms (radical,branch-shaped,mixed) of loading and unloading points are unified into branch-shaped,which may not affect the validity of the algorithms.关键词
铁路车站/取送车作业/哈密尔顿图/动态规划法/C-W节约改进算法Key words
railway station/placing-in and taking-out operation of wagons/Hamilton graph/dynamic pro-gramming method/improved Clarke-Wright saving algorithm分类
交通工程
