Multi-traveling salesman problem traveling salesman problem is a single expansion, with a wider range of practical significance. M TSP in the study of the characteristics of solutions based on the smallest share of the total number of traveling salesman tour and visit the points, the smallest share of the total trip distance to visit more than two goals of the M TSP problem and were given the corresponding mathematical model, algorithm and application examples, examples show that the model is correct.

任务均分的多旅行商问题.pdf

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