本文通过遗传算法解决基本的无时限车辆调度问题。采用车辆和客户对应排列编码的遗传算法，通过种群初始化，选择，交叉，变异等操作最终得到车辆配送的最短路径。通过MATLAB仿真结果可知，通过遗传算法配送的路径为61.5000km,比随机配送路径67km缩短了5.5km。此结果表明遗传算法可以有效的求解VRP问题。(In this paper, genetic algorithm is used to solve the basic vehicle scheduling problem without time limit. Using the genetic algorithm of vehicle and customer corresponding permutation coding, through the initialization of population, selection, crossover and mutation, the shortest route of vehicle delivery is obtained. Through MATLAB simulation results, we can see that the route of delivery through genetic algorithm is 61.5000km, which is 5.5km shorter than the random delivery path 67km. The results show that the genetic algorithm can solve the VRP problem effectively.)