SIACO: a novel algorithm based on ant colony optimization and game theory for travelling salesman problem

Demison Rolins de Souza Alves, M. T. R. S. Neto, Fabio dos Santos Ferreira, O. N. Teixeira
{"title":"SIACO: a novel algorithm based on ant colony optimization and game theory for travelling salesman problem","authors":"Demison Rolins de Souza Alves, M. T. R. S. Neto, Fabio dos Santos Ferreira, O. N. Teixeira","doi":"10.1145/3184066.3184077","DOIUrl":null,"url":null,"abstract":"The following paper demonstrates the possibilities of adapting the Ant Colony Algorithm with Social Interaction coming from Game Theory. This novel algorithm, named Social Interaction Ant Colony Optimization (SIACO), were based on the Ant System Algorithm developed by Dorigo and Social Interaction created by Otávio Teixeira in Genetic Algorithm. A new phase was inserted in the Ant System and the game is performed by two ants inside the colony. Four instances of Travelling Salesman Problem (TSP) were used to validate the approach and its results shows that the proposed can be a rival of other algorithms when applied to this class of problems.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Machine Learning and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3184066.3184077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The following paper demonstrates the possibilities of adapting the Ant Colony Algorithm with Social Interaction coming from Game Theory. This novel algorithm, named Social Interaction Ant Colony Optimization (SIACO), were based on the Ant System Algorithm developed by Dorigo and Social Interaction created by Otávio Teixeira in Genetic Algorithm. A new phase was inserted in the Ant System and the game is performed by two ants inside the colony. Four instances of Travelling Salesman Problem (TSP) were used to validate the approach and its results shows that the proposed can be a rival of other algorithms when applied to this class of problems.
SIACO:一种基于蚁群优化和博弈论的旅行商问题求解算法
下面的文章演示了将蚁群算法与博弈论中的社会互动相结合的可能性。该算法基于Dorigo提出的蚂蚁系统算法和Otávio Teixeira在遗传算法中提出的社会交互算法,命名为Social Interaction Ant Colony Optimization (SIACO)。在蚂蚁系统中插入了一个新阶段,游戏由殖民地内的两只蚂蚁进行。用四个旅行推销员问题实例对该方法进行了验证,结果表明,该方法在求解该类问题时优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信