Fuzzy Expert Ants to speed up big TSP Problems using ACS

F. Mohammadi, A. F. Fathi
{"title":"Fuzzy Expert Ants to speed up big TSP Problems using ACS","authors":"F. Mohammadi, A. F. Fathi","doi":"10.18495/COMENGAPP.V3I3.68","DOIUrl":null,"url":null,"abstract":"Ant colony algorithms are a group of heuristic optimization algorithms that have been inspired by behavior of real ants foraging for food. In these algorithms some simple agents (i.e. ants), search the solution space for finding the suitable solution. Ant colony algorithms have many applications to computer science problems especially in optimization, such as machine drill optimization, and routing. This group of algorithms have some sensitive parameters controlling the behavior of agents, like relative pheromone importance on trail and pheromone decay coefficient. Convergence and efficiency of algorithms is highly related to these parameters. Optimal value of these parameters for a specific problem is determined through trial and error and does not obey any rule. Some approaches proposed to adapt parameter of these algorithms for better answer. The most important feature of the current adaptation algorithms are complication and time overhead. In this paper we have presented a simple and efficient approach based on fuzzy logic for optimizing ACS algorithm and by using different experiments efficiency of this proposed approach has been evaluated and we have shown that the presented concept is one of the most important reasons in success for parameter adapting algorithms.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Engineering and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18495/COMENGAPP.V3I3.68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Ant colony algorithms are a group of heuristic optimization algorithms that have been inspired by behavior of real ants foraging for food. In these algorithms some simple agents (i.e. ants), search the solution space for finding the suitable solution. Ant colony algorithms have many applications to computer science problems especially in optimization, such as machine drill optimization, and routing. This group of algorithms have some sensitive parameters controlling the behavior of agents, like relative pheromone importance on trail and pheromone decay coefficient. Convergence and efficiency of algorithms is highly related to these parameters. Optimal value of these parameters for a specific problem is determined through trial and error and does not obey any rule. Some approaches proposed to adapt parameter of these algorithms for better answer. The most important feature of the current adaptation algorithms are complication and time overhead. In this paper we have presented a simple and efficient approach based on fuzzy logic for optimizing ACS algorithm and by using different experiments efficiency of this proposed approach has been evaluated and we have shown that the presented concept is one of the most important reasons in success for parameter adapting algorithms.
模糊专家蚂蚁用ACS加速大型TSP问题
蚁群算法是一组启发式优化算法,受到真实蚂蚁觅食行为的启发。在这些算法中,一些简单的智能体(如蚂蚁)通过搜索解空间来寻找合适的解。蚁群算法在计算机科学问题中有许多应用,特别是在优化问题上,如机器钻的优化和路由。这组算法具有控制agent行为的敏感参数,如信息素在路径上的相对重要性和信息素衰减系数。算法的收敛性和效率与这些参数密切相关。对于特定问题,这些参数的最优值是通过试错确定的,不遵循任何规则。提出了一些方法来调整这些算法的参数以获得更好的结果。当前自适应算法的最大特点是复杂性和时间开销。本文提出了一种基于模糊逻辑的简单有效的优化ACS算法的方法,并通过不同的实验对该方法的效率进行了评估,并表明所提出的概念是参数自适应算法成功的最重要原因之一。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信