Study on Multi-depot Vehicle Scheduling Problem Based on Milk-Run Model

摘要

After analyzing the multi-depot vehicle scheduling problem, a mathematical model which takes the shortest single distribution as the target function was built. First of all, the paper make it to be the different single distribution center vehicle scheduling problem by dividing all the suppliers, then use genetic algorithm to solve the single distribution center VSP problem. Finally, verify the effectiveness of the model and the algorithm with examples based on theMaple soft.