原创力文档- 1、本文档共5页，可阅读全部内容。
- 2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
- 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
- 5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
- 6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传，每下载1次， 网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Solving TSP with Shuffled Frog-Leaping Algorithm----蛙跳算法用于求解TSP问题
Eighth International Conference on Intelligent Systems Design and Applications
Solving TSP with Shuffled Frog-Leaping Algorithm
LUO Xue-hui, YANG Ye, LI Xia
College of Information Engineering, Shenzhen University, Shenzhen 518060, China
Email: lixia@
Abstract memes carried by interactive individuals and a global
exchange of information among the frog population. It
Shuffled frog-leaping algorithm (SFLA) is a new combines the advantages of the genetic-based memetic
memetic meta-heuristic algorithm with efficient algorithm (MA) and the social behavior-based PSO
mathematical function and global search capability. algorithm with such characteristics as simple concept,
Traveling Salesman Problem (TSP) is a complex fewer parameters adjustment, prompt formation, great
combinatorial optimization problem, which is typically capability in global search and easy implementation.
used as benchmark for testing the effectiveness as well While proposed primarily for solving the multi-
as the efficiency of a newly proposed optimization objective engineering problems such as water resource
algorithm. When applying the shuffled frog-leaping distribution [4], bridge deck repairs [5] and job-shop
algorithm in TSP, memeplex and submemeplex are scheduling arrangem
文档评论（0）