M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2 mum. Th is is calledM ult ip le T raveling Salesmen P roblem (M TSP). There are various heurist ic methods to obtain op t imal o r near2op t imal so lut ions fo r the TSP p roblem. But to the M ult ip le T raveling Salesmen P roblem , there are no t much app roaches to so lveM TSP. In th is paper, a hy2 brid genet ic algo rithm to so lve TSP and M TSP is p resented. Th is algo rithm combines GA and heurist ics. N umerical experiments show that the new algo rithm is very efficient and effect ive.

求解TSP和MTSP的混合遗传算法_英文_.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．