依据数量调配和网络配流两个空车调整的核心问题,建立了空车调整协同优化模型,并设计了相应的蚁群算法。由于共同径路约束与模型是不协调的,且对流约束不会对模型的最优解产生影响,故而模型可以描述为线性整数规划模型。同时,研究表明蚁群算法对求解空车调整问题具有一定优势。 According to the core problems of quantity emptying and network emptying adjustment, an empty vehicle tuning collaborative optimization model was established and the corresponding ant colony algorithm was designed. Because common path constraints are not compatible with the model, and convection constraints will not affect the optimal solution of the model, the model can be described as a linear integer programming model. At the same time, the research shows that the ant colony algorithm has certain advantages for solving the empty vehicle adjustment problem.