改进的蚁群算法求解tsp问题的分析-analysis of improved ant colony algorithm to solve tsp problem.docxVIP

改进的蚁群算法求解tsp问题的分析-analysis of improved ant colony algorithm to solve tsp problem.docx

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

中北大学学位论文 中北大学学位论文 将以上三步算法的改进结合起来,用 MATLAB 模拟,选取了 TSPLIB 中的十个 TSP 问 题进行实验,并与用基本蚁群算法做的结果以及现在应用比较广泛的遗传算法的结果做 了比较。然后运用改进的蚁群算法对以中国 100 城市为代表的中国旅行商问题进行了数 值模拟并与用基本蚁群算法做的结果以及神经网络算法求解的结果做了比较。结果表明 虽然运行时间变长了,但改进后的蚁群算法在全局搜索最优解能力上要好很多,在稳定 性和收敛性方面也有了较大提高。 最后对全文的研究工作进行了总结,并展望了蚁群算法进一步还要研究的课题。 关键词:蚁群算法,旅行商问题,自适应,信息素 ABSTRACT Ant colony optimization algorithm (ant colony optimization, ACO), which was first proposed by Italian scholars named Marco Dorigo, V Maniezzo, A. Colorni in 1992, is a groups intelligent optimization methods based on the development of the biological behavior of marching along the shortest path in the process of ant community grazing. The proposed algorithm is obtained encouraging effect in the combinatorial optimization with NP-hard characteristics problem which is difficult to work in traditional optimization method, and is widely attended by the academia and industry. At present, the ant colony optimization algorithm has become an important branch of the intelligent calculating method, and become the prosperous development of the hot research topic nowadays. The study of the theory of the ant colony optimization algorithm relatively lags behind, especially for that there still need further study for the algorithm parameter selection and the convergence proof. Although, this research method is in its infancy, but some research has shown the superiority of the ant colony system in solving complex optimization problem. At present, the ant colony system has been successfully applied to the solving of traveling salesman problem (TSP), quadratic assignment problem (QAP) and job-shop scheduling problem and has got good experimental results. TSP (Traveling Salesman Problem) is also known as the HuoLangDan Problem or the touring Salesman Problem, in operations research, and it has widely range of applications in operational research, management science and engineering practice. TSP is a famous problem of the combination optimization, and more and more researchers hav

您可能关注的文档

文档评论(0)

peili2018 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档