TSP is a typical NP complete problem, and its worst-case time complexity increases exponentially as the problem size increases. So far, no polynomial time efficient algorithm has been found.

chapter4\CityPosition1.mat
chapter4\CityPosition2.mat
chapter4\CityPosition3.mat
chapter4\Distanse.m
chapter4\DrawPath.m
chapter4\dsxy2figxy.m
chapter4\Fitness.m
chapter4\GA_TSP.m
chapter4\InitPop.m
chapter4\Mutate.m
chapter4\OutputPath.m
chapter4\PathLength.m
chapter4\Recombin.m
chapter4\Reins.m
chapter4\Reverse.m
chapter4\Select.m
chapter4\Sus.m
chapter4

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