Demison Rolins de Souza Alves, M. T. R. S. Neto, Fabio dos Santos Ferreira, O. N. Teixeira
{"title":"SIACO:一种基于蚁群优化和博弈论的旅行商问题求解算法","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":"{\"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}","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
摘要
下面的文章演示了将蚁群算法与博弈论中的社会互动相结合的可能性。该算法基于Dorigo提出的蚂蚁系统算法和Otávio Teixeira在遗传算法中提出的社会交互算法,命名为Social Interaction Ant Colony Optimization (SIACO)。在蚂蚁系统中插入了一个新阶段,游戏由殖民地内的两只蚂蚁进行。用四个旅行推销员问题实例对该方法进行了验证,结果表明,该方法在求解该类问题时优于其他算法。
SIACO: a novel algorithm based on ant colony optimization and game theory for travelling salesman problem
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.