Research On Collaborative Vehicle Routing Problem Considering Balance Of Benefits

Collaborative vehicle routing problem(CVRP)is the centralized scheduling of transportation and distribution activities by sharing various kinds of logistics resources,such as information,customers,vehicles and depots.When the collaboration participants come from the same enterprise or group,it usually does not involve the problem of benefit allocation or cost allocation.In this condition,CVRP has certain limitations and is not suitable for the complex logistics network in reality.Existing research ignores the existence of common customers when considering the collaborative vehicle routing problem between different carriers,and seldom pays attention to the problem of benefit allocation in collaborative transportation.In response to the above problems,this paper takes two different carriers as the main body,and proposes a collaborative vehicle routing problem that considers the balance of benefits(CVRP-BB).In this problem,the cooperative transportation network with common customers is considered firstly,and the optimal goal is to minimize the total transportation cost of the alliance.Finally,the surplus benefits obtained by the alliance are fairly allocate between the two carriers,so as to maintain the balance of benefits between the two parties after the collaboration.In this paper,a shared common customer collaboration vehicle routing problem(SCC-CVRP)is considered,and a mixed integer model is established with the minimum total transportation cost of the alliance as the objective function.After that,this paper design an improved genetic algorithm,this algorithm is mainly improved from two aspects: initial solution generation and adaptive genetic operator.This study constructs 10 groups of small-scale instances,respectively uses CPLEX solver and improved genetic algorithm to test them,compares the two solutions to prove the correctness of the mathematical model and algorithm,and through 10 groups of medium and large-scale instances,respectively use the traditional genetic algorithm and the improved genetic algorithm are used to solve the problem,and the improvement effect of the algorithm is verified in terms of the number of iterations and running time.On this basis,this paper constructs 30 sets of instances considering common customers according to the standard example of multi-site vehicle routing problem,and calculates the total transportation cost of two carriers in separate transportation and collaborative transportation,and measures it from a quantitative perspective.The cost savings brought by collaborative transportation are improved.And on this basis,the differences before and after coordinated transportation are compared from the perspectives of route optimization and vehicle loading rate.Finally,by changing the number of sharable customers,the influence of the degree of sharing on the cooperative vehicle routing problem is analyzed.The data simulation results show that the improved genetic algorithm designed in this paper can effectively solve the SCC-CVRP.After collaborative transportation,the overall average saving value of 30 groups of examples is 11.62%,and the overall average saving value of two carriers after collaborative transportation is 11.49% and14.08% respectively.When the vehicle carrying capacity is 80,100 and 120,the loading rates of the two carriers are increased by 5.38%,6.56% and 6.36% respectively.Data experiments prove that with the increase in the number of shareable customers,the total transportation cost of the alliance is reduced by 6.09%,8.04%,9.80%,10.76% and14.75% on average.Therefore,considering the SCC-CVRP,we can optimize the transportation cost and vehicle loading rate,and the more customers the two carriers share,the more cost optimization the alliance can obtain.Based on the vehicle route optimization that has obtained the minimum total transportation cost of the alliance,this paper considers the balance of benefits among alliance participants,and designs a modified Nash negotiation model from the perspective of considering the contribution of participants to the alliance by using the cooperative game theory,so as to distribute the remaining benefits of the alliance fairly and effectively.Use the constructed examples to calculate the benefit distribution and analyze the result of the benefit distribution.In conclusion,the study of CVRP-BB provides certain theoretical guidance for logistics companies that provide the same logistics services to carry out collaborative transportation and allocate the benefits after collaboration.