物流配送路径延伸问题两阶段寻优策略算法

首先根据实际路径资料构建非完全有向图,利用Dijkstra算法得到任意两点之间的最优路径,根据要求虚拟合并或删除非目的地节点,对图形进行简化,重新构造出包含所有有效路径信息和有效节点的非完全有向图,在此基础上运用非完全有向图TSP问题的求解方法进行路径优化。通过示例验证了该算法对于解决物流配送中的此类特定问题是有效的。

A Two-stage Optimization Algorithm for the Distribution Route Extension Problem

In this paper,a non-complete directed graph is drawn according to practical route information and materials and the Dijkstra algorithm is used to calculate the shortest path between any given two points.Then the graph is simplified through virtual combining or deleting the non-destination points as is required and restructured into a non-complete directed graph containing information concerning all feasible routes and points,on the basis of which a solution to the Traveling Salesman Problem of the graph is developed to optimize the distribution routing.Finally a numerical example is used to illustrate the validity of this algorithm in distribution routing problems.