论文部分内容阅读
以理论研究为主,通过对空车调整问题的特点分析,明确了空车数量调配和网络配流是空车调整的两个核心问题;在分析已有模型及对问题进行抽象描述的基础上,建立了空车调整协同优化(EWDCO)模型,并设计了相应的蚁群算法。分析发现,共同径路约束与EWDCO模型是不协调的;通过对定理的证明得出,对流约束不会对EWDCO模型的最优解产生影响,模型可以描述为线性整数规划模型,其实质是带容量约束的最小费用流模型。同时,研究表明ACO对求解空车调整问题具有一定的优势,是一种较为有效的算法。
Based on the analysis of the characteristics of the empty car adjustment problem, it is clear that the empty car allocation and the network allocation are the two core issues of empty car adjustment. Based on the analysis of the existing models and the abstract description of the problem, The Empty Vehicle Coordination Optimization (EWDCO) model was established and the corresponding ant colony algorithm was designed. The analysis shows that the common path constraint is inconsistent with the EWDCO model. Through the proof of the theorem, the convection constraint will not affect the optimal solution of the EWDCO model. The model can be described as a linear integer programming model, Constraints of the minimum cost flow model. At the same time, the research shows that ACO has some advantages for solving the empty vehicle adjustment problem and is a more effective algorithm.