论文部分内容阅读
数量调配和网络配流是铁路冷藏车空车调整的2个核心问题。在对问题进行抽象描述的基础上,建立了铁路冷藏车空车调整协同优化模型,将空车调整径路与数量两者统一到同一个模型中,实现两者整体上的优化。通过约束条件分析,在不改变铁路冷藏车空车调整问题协同优化性质的前提下对模型进行简化,将非线性模型转化为线性模型,设计相应的蚁群算法(ACO),并对算法复杂度进行分析。通过理论分析和实际算例分析表明,ACO算法易于利用计算机实现,对求解铁路冷藏车空车调整问题具有优势。
The number of distribution and distribution network with the railway empty car empty car to adjust the two core issues. On the basis of the abstract description of the problem, a collaborative optimization model of empty car for railway refrigerated trucks is set up, and the empty car adjusted ways and numbers are unified into the same model to achieve the overall optimization. Through the analysis of constraint conditions, the model is simplified without changing the co-optimization nature of the empty car tuning problem, the nonlinear model is transformed into a linear model, the corresponding ACO is designed, and the complexity of the algorithm Analyze. The theoretical analysis and practical examples show that the ACO algorithm can be easily implemented by computer and has the advantage of solving the empty car adjustment problem of railway refrigerated trucks.