铁路车站取送车作业问题模型及求解方法

Model and Solution of Wagons＇ in Railway Placing-in and Taking-out Station

取送车作业是货物作业较多的铁路车站一项重要的技术作业。把车站作业点的3种布置形式（放射形、树枝形和混合形）统一为树枝形，在设定条件下，以作业点（车站）间机车走行时间为权，把铁路车站取送车作业优化问题转化求解哈密尔顿图最短路问题，设计动态规划法和-节约改进算法分别进行求解，并举例比较两种算法的优缺点，提出了两种算法的应用范围。

Placing-in and taking-out of wagons are important technical operations railway stations. The three kinds of arrangement form （radical, branch-shaped, mixed） of loading and unloading point are unified into branch-shaped. Taking the locomotive running time between operating points （stations） as powers, the optimization problem of placing-in and taking-out of wagons is transformed into the shortest path problem of Hamilton map under the set conditions, which is solved by dynamic programming method and the Clarke- Wright saving algorithms improved. Advantages and disadvantages of the two algorithms are also generalized by the example given. At last, scope of application to the two algorithms are proposed.