ABSTRACT
In this paper, the vehicle routing optimization problem in the distribution process of express logistics joint distribution alliance is studied. According to the actual situation that client nodes have with regard to time windows, the delivery goods arrive at the distribution center in batches, and the vehicle can be repeatedly used in these actual situations, and based on the purpose of saving the transportation cost. We put forward with the Multi Trip Split Delivery Vehicle Routing Problem with Time Window and Release Dates and establish the problem's mathematical model with the minimizing of distribution costs as object function. Considering the difficulty of solving the problem, this paper designs a modern heuristic algorithm, the discrete particle swarm optimization algorithm, and takes the instance data as the input to solve the algorithm programmatically. The experimental results show that the vehicle routing optimization method proposed in this paper can bring more cost savings compared with the separate distribution of vehicles of different enterprises in the non-joint distribution mode, and this method is more suitable for the joint distribution mode.
