多层次约束下铁路阔大货物路径选择研究

合理地组织阔大货物运输,能更好地保障运输安全及降低运输过程的成本。针对阔大货物运输过程中,运输线路受多项限制条件约束情况下的最优线路搜索问题,以时间最短、干扰最小为目标,以车辆限界、线路干扰程度为约束,建立了0-1规划模型。针对不同影响强度逐步放宽约束条件,对不同程度的约束,分别采用广度优先搜索算法进行求解。该方法计算量相对较小,且更易取得满意解,在较大程度上减少模型求解计算时间。实例验证表明,本文建立的模型与算法在求解14个节点的复杂问题时,能较快地得到理想解,能为现场决策人员提供技术支持。

Research on the Path Selection of Railway Exceptional Dimension Freight unde Multilevel Constraints

Reasonable organization of exceptional dimension freight transport can ensure transportation safety and reduce the transportation cost. To the transportation of exceptional dimension freight, transport routes are subjected to a number of restrictions. For this problem of the optimal route search, this paper establishes a 0-1 programming model with the goals of the shortest time, the least interference and with the constraints of vehicle gauge, the degree of line interference. This paper gradually liberalizes the constraint conditions for different impact strength and respectively uses the breadth first search algorithm for different degrees of constraints. This method is relatively small and easier to obtain a satisfactory solution and reduces the calculation time model to a large extent. The example proved that the model and algorithm established by this paper can get the ideal solution faster when solving the complex problem of 14 nodes and can provide technical support for the decision makers.