混合禁忌搜索算法的邮政运输车辆调度问题研究

在邮政企业中，运输网络是整个系统得以顺利运行的基础，邮政企业如何充分发挥自身优势、整合资源以改善运输网络是市场竞争愈发激烈情况下面临的重大问题，尤其是邮路规划问题。为提高邮政运输网络的整体运行效率，在同时考虑往返货物归集、车载量限制、最短路径和最少车辆数等一系列约束条件情况下，建立了送取货一体化的多中心邮政运输车辆调度的数学模型；针对该模型设计了禁忌搜索算法与C-W节约里程算法相结合的求解优化算法。最后，通过贵州省邮政企业实际生产数据对模型和算法进行仿真验证，并对优化后的调度方案进行了结果和效果分析。实验结果表明，优化后求得的配送策略在优化邮运成本上效果明显。

Study on postal vehicle routing problem based on mixed taboo search algorithm

In order to enhance the operational efficiency of postal transportation network, a model of multi-center vehicle routing problem with parcel pick-up and delivery has been built for the China Post, in which some constrains, such as round-trip collection, carrying capacity, the shortest path and the least vehicle numbers, are also considered in the presented model. To solve this model, the mixed algorithm with taboo search and saving algorithm is presented. Finally, the simulated analysis of the model and algorithm is performed with the production data of Guizhou Post; meanwhile, the optimal results from the model are analyzed. The results show that the distribution strategy of this paper is more efficient, the proposed model and algorithm are valid and practical.