邮政高速运输网优化

Optimizing Highway Transportation Network at Postal Service

在对邮政高速运输网进行简单描述的基础上,建立了问题的数学模型。提出了采用k-最短路搜索法搜索出备选路由,混合整数规划进行求解的策略。设计了k-最短路搜索备选路由的算法和求解问题的CPLEX模型,并进行了实验计算。计算结果表明,用本文设计的算法和CPLEX模型,不仅可以取得很好的结果,而且计算效率高。

On the basis of describing the highway transportation network at postal service problem naturally, the model of the problem is built . The solving tactics of searching backup trips using k-shortest paths and optimizing model using mix integer programming are presented. The k-shortest paths algorithm for searching the backup trips and the CPLEX model for the problem are designed. The computational results demonstrate that the high quality solutions to the highway transportation network at postal service problem can be obtained by using the new algorithm and CPLEX model, and the new algorithm and CPLEX model are also efficient.