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.

遗传算法求解VRP问题的技术报告.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．