基于第三方物流的家具配送开放式车辆路径问题

Open Vehicle Routing Problem of Furniture Distribution Based on the Third-party Logistics

为了降低家具配送成本,提高物流效率,基于第三方物流配送模式,构建了以总行驶距离最短和车辆数最少为最优目标的开放式车辆路径问题(open vehicle routing problem,OVRP)数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解,第1阶段求解包含所有客户的TSP(traveling salesman problem)路径来作为第2阶段划分OVRP路径的基础.设计了一个随机动态禁忌表,并将"邻域算子编号"和"邻域交换点对"同时作为禁忌对象,避免了过度禁忌的情况.另外,对5个邻域算子进行了测试,表明采用由点交换、分序点插入、点逆序和前点前向插入这4个算子组成的多邻域结构体效果最佳.经算例测试和文献对比,验证了设计算法的有效性,采用第三方物流配送比自营物流配送更节省成本.

To reduce the furniture distribution cost and improve the logistics efficiency,on the basis of the thirdparty logistics distribution method,we construct a mathematical model of the open vehicle routing problem(OVRP)with the shortest total driving distance and minimum number of vehicles as the objective functions and design an improved two-stage tabu search algorithm to solve the problem.The traveling salesman problem path of all clients solved in the first stage is used as the basis for dividing the OVRP path in the second stage.We design a stochastic dynamic tabu list.The"neighbor operator number"and"neighbor exchange point pair"are simultaneously used as taboo objects,thereby avoiding excessive taboos.In addition,we test five neighborhood operators,which show that the multi-neighbor structure consisting of four operators,namely,point exchange,sequence point insertion,point reverse order,and front point forward insertion,is the best.Through the case tests and literature comparisons,we verify the effectiveness of the improved tabu search algorithm.The use of third-party logistics distribution is more cost-effective than the use of self-operated logistics.