- 1、本文档共56页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
一种基于动态局部搜索的蚁群算法及其对tsp问题的求解-计算机应用技三术专业毕业论文
幅度加快收敛速度。各方面都显示,它的性能要优于传统蚁群算法。关键词:蚁群算法动态局部搜索TSP问题求解质量与稳定性
幅度加快收敛速度。各方面都显示,它的性能要优于传统蚁群算法。
关键词:蚁群算法动态局部搜索TSP问题求解质量与稳定性
Ⅱ
万方数据
A
A NEW ANT COLONY ALGORITHM BASED ON
DYNAMIC LOCAL SEARCH FOR TSP
AB STRACT
As the traditional ant colony algorithm(ACA)for solving TSP(traveling salesman problem)is easy to fall into a local optimal solution and slow convergence,also the quality and stability of solution is not ideal.To solve these problems,an core improved ant colony algorithm based on dynamic Iocal(DLACA)search which achieved by scout ant,the three auxiliary strategies are city classification,enlarge the gap of pheromone and clear pheromone after
inherit is proposed.
City classification means that at the beginning of the algorithm,we should classify all cities into several classes.cities of different types represent different levels of the city,and more ants to the higher ranks,while the lower ranks are opposite;And through the introduction of bionics scout ants,is that during ant
routing process,if there is the difficulty of choosing cause that it is difficult to choose what way to go,dispatched as appropriate scout ants help to explore,at the end contrast the length of scout ants and ant path to decide which path a is
better.In each routing is completed,the new pheromone update strategy appear, which is obtain when the time iteration of the shortest path,and ratio with the shortest path before when the time of seeking,if the ratio is greater,pheromone update amplitude is bigger also;Wrhen the algorithm falls into local optimal,in Ⅲ
万方数据
order
order not to let the pheromone completely cleared,use a inherited strategy,SO that not only can jump out of local optimum,but also carl improve the efficiency of the algorithm.
The principle of traditional ant colony algorithm to solve TSP were in detail,
the analysis of ant colony algorithm in solving traveling salesman problem(TSP) produces the root cause of the three defects,starting from the root causes,design improved ant colo
您可能关注的文档
- 一种高输入电压led驱中动器的分析.docx
- 一种旱式喷泉池石材地分面的线性收水的构造解读.doc
- 一种改进的工作流四模型的分析与实现.docx
- 一种机械式停水自闭水龙头关的构思论文.doc
- 一种改你进的无线传感器网络dv-hop定位算法的研究.docx
- 一种红球菌全基因组范围的顺式上调控结合位点的预测分析.docx
- 一种高效智能型led路灯驱条动电源的分析与设计.docx
- 一种高性能dc-dc是稳压变换器研究.docx
- 一种基于modelm到agic3d的cadcam平台基础部分的研究与开发.docx
- 一种基于p2p流媒体直官播系统的分析与实现.docx
- 招生宣传与社交媒体策略.pptx
- 2025-2030橙汁产业规划专项研究报告.docx
- 2025-2030散装盐行业市场现状供需分析及重点企业投资评估规划分析研究报告.docx
- 2025-2030板鞋行业发展分析及投资价值研究咨询报告.docx
- 2025-2030数码文化设备产业市场深度调研及发展趋势与投资研究报告.docx
- 2025-2030气体燃料内燃机行业发展分析及投资价值研究咨询报告.docx
- 2025-2030氯化锌干电池行业市场现状供需分析及重点企业投资评估规划分析研究报告.docx
- 2025-2030核磁共振设备市场前景分析及投资策略与风险管理研究报告.docx
- 2025-2030棉花行业风险投资运行分析及运作模式与投融资研究报告.docx
- 2025-2030殷瓦钢行业市场深度调研及前景趋势与投资研究报告.docx
文档评论(0)