The Travelling Salesperson problem 旅行销售员问题.pptVIP

下载本文档

63
0
约6.28千字
约 12页
2017-03-09 发布于上海
举报
版权申诉

The Travelling Salesperson problem 旅行销售员问题.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

The Travelling Salesperson problem 旅行销售员问题

The Nearest Neighbour AlgorithmThe Lower Bound Algorithm The Tour Improvement Algorithm The Nearest Neighbour Algorithm The Lower Bound Algorithm The Tour Improvement Algorithm * D1Discrete Mathematics The Travelling Salesperson problem The Travelling Salesperson: Travelling salesperson problems tackle this by first turning the towns and roads into a network. We have seen that finding a tour that visits every arc (route inspection) depended on earlier work by Euler. Similarly the problem of finding a tour that visits every node (travelling salesperson) was investigated in the 19th Century by the Irish mathematician Sir William Hamilton. Typically a travelling salesperson will want to cover all the towns in their area using the minimum driving distance. Definition: A Hamiltonian cycle is a tour which contains every node once ACBDA with weight 16 There are just three essentially different Hamiltonian cycles: Consider the Hamiltonian cycles for this graph A C B D 4 2 6 5 4 4 ABCDA with weight 17 ABDCA with weight 17 A C B D 4 2 6 4 A C B D 4 5 4 4 A C B D 2 6 5 4 A salesperson living in town B, say, may still want to find the shortest round trip visiting every town. Consider this graph: However, not all graphs have Hamiltonian cycles. A C B D 23 12 38 35 33 21 To enable you to use the next three algorithms you can replace any network like this one by the complete network of shortest distances. The shortest distance between A and B is 35 (via D: 12 + 23) The shortest distance between A and C is 33 (via D: 12 + 21) Adding direct arcs AC and AD does not change the problem but does produce a graph with Hamiltonian cycles. The rest of this module assumes the problem is always the classical one of finding a Hamiltonian cycle of minimum weight with no repetition of nodes. Our next algorithm is called the “Nearest Neighbour” – it will find a solution to a travelling salesperson problem but not necessarily the best (optimum). So we will then look at finding limits between w