On the Split Delivery Vehicle Routing Problem Based on Python

This paper studies the split delivery vehicle routing problem (SDVRP) with single depot, single type of vehicle, without windows, loading-unloading. Then, the three subscript mathematical model of SDVRP is established. In this paper, we adopt natural number to code, generates the initial solution randomly, take fit(i)=l/zi×100 as fitness function, take p(i) as the selection probability, and adopt reciprocal exchange mutation as the variation operation. We call the geatpy library encapsulated in Python to cross, and use partial mapping cross PMX, and the called method is named xovpm, and we use 50 generations of the maximum evolutionary generation as the termination condition. Compared with three cases, the advantages of this genetic algorithm (GA) are verified, and this GA shows that the split strategy can provide a new idea for distribution service.