- File Size:
- Uploaded by:
Description: In this paper, genetic algorithm is used to solve the basic untime-limited vehicle scheduling problem. The shortest route of vehicle distribution is obtained through population initialization, selection, crossover, mutation and other operations using the genetic algorithm of vehicle and customer corresponding arrangement coding. MATLAB simulation results show that the distribution path by genetic algorithm is 61.5000km, which is 5.5km shorter than the random distribution path of 67km. The results show that the genetic algorithm can effectively solve the VRP problem.
(Click to check if it's the file you need, and recomment it at the bottom):
|遗传算法求解VRP问题的技术报告.doc|| 217600 || 2017-07-23|