Genetic algorithm tsp problem of logistics distribution routing optimization problem subject, this paper introduces 0-1 programming ideas, a mathematical model with the constraints of logistics and distribution problems. Solving, introducing genetic algorithm encoding, and the number of partitions and the number of customers for a small difference, the flexible use of the partition containing the partition algorithm to determine the distribution of the optimal solution sequence group, closely enumeration method allows both the algorithm is simple, fast advantages. Matlab software application executable to get the shortest path. Complex factors affecting both the time, we introduce a penalty function, and by setting the penalty coefficient, and further obtain the optimal path from the shortest path.

图2.png
图1.png
图3.png
A题 王政
........\Amerce.m
........\Fitness.m
........\GA_TSP.m
........\InitPop.m
........\Mutate.m
........\OutputPath.m
........\PathLength.m
........\Recombin.m
........\Reins.m
........\Reverse.m
........\Select.m
........\Sus.m

• 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．