Research On Split Delivery Vehicle Routing Problem And Revenue Sharing Of Supply Chain

The Vehicle Routing Problem(VRP)is a classic problem in logistics area.Its research scenarios and algorithm technology types have gradually approached reality,become complex and diversified in the past sixty years.The Split Delivery Vehicle Routing Problem(SDVRP)is a new branch of vehicle routing problem research that emerged 30 years ago.It belongs to a new type of pickup and delivery mode,which helps companies to further reduce transportation costs.This type of problem has gradually attracted attention in academic and practical fields since the 1990 s,but compared with the research results of VRP problems,there are much less articles on SDVRP,and most of them are concentrated on the research of solving algorithms.Based on this,this paper studies the SDVRP problem from the perspectives of algorithm solving and revenue sharing.The main findings and innovations are as follows:(1)The theoretical research results of the SDVRP are reviewed,including the characteristics of the solution,the solution algorithm,the solution scenario,and the cost savings,as the theoretical and methodological basis of this paper.(2)A three-stage clustering algorithm is designed to solve the near-optimal solution of the vehicle routing problem with separable requirements for the pure pick-up(or delivery)scene of a single car park and the same type of vehicle.In the first stage,the customer points are divided into two-level clustering groups,and the basic balance demand is within the acceptable range;in the second stage,the overloaded and dissatisfied groups are pushed and pulled,and the split point is determined to make the demand of all groups All are controlled within the range of the vehicle’s cargo capacity;in the third stage,the shortest route is arranged for the customer points in the group with the aid of the simulated annealing algorithm.This algorithm can minimize the number of splits while avoiding the long time-consuming problem of heuristic algorithms.(3)Innovatively apply the improved Shapley value method to the distribution of transportation cost savings to compensate for the additional contributions of participating companies in the process of separation and delivery.Due to the increase in the hidden costs of the member companies in the logistics system caused by the split,some implementation mechanisms need to be designed to ensure the operability of the demand splitting and delivery.This paper designs an improved Shapley value method to allocate cost savings to member companies participating in demand splitting vehicle routing.Considering three factors affecting the distribution of benefits—cooperative risk sharing,innovation resource input,and business execution strength,the traditional Shapley value method is modified to obtain a revenue distribution strategy that more meets the needs and can split the vehicle routing problem.(3)Taking the case of a distribution center of FAW Logistics as the background,the threestage clustering algorithm was used to study the transportation plan changes brought by the split-demand mode and the application effect of cost-saving allocation,and compared with other algorithms(K-means Accurate clustering algorithm and heuristic algorithm).It is found that the solution designed in this paper is more practical and valuable.At the expense of less transportation cost,it can make the pick-up more efficient,the coordination difficulty lower,and the member companies participate The return value after distribution is greater.