{"title":"旅行商问题的离散燕子群优化算法","authors":"Safaa Bouzidi, M. E. Riffi","doi":"10.1145/3128128.3128141","DOIUrl":null,"url":null,"abstract":"Swallow Swarm Optimization is a new metaheuristic of swarm intelligence based algorithm appeared by Neshat in 2013 in the continuous case. This optimization algorithm inspired by the intelligent behaviors of swallows. In This paper, we provide an adaptation of the swallow swarm optimization (SSO) to solve the famous traveling salesman problem (TSP), as one of the known combinatorial optimization problems. In order to test the performance of the algorithm described herein, we resolve a set of benchmark instances from TSPLIB library. The results obtained demonstrate that DSSO is performant than other metaheuristics methods.","PeriodicalId":362403,"journal":{"name":"Proceedings of the 2017 International Conference on Smart Digital Environment","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Discrete swallow swarm optimization algorithm for travelling salesman problem\",\"authors\":\"Safaa Bouzidi, M. E. Riffi\",\"doi\":\"10.1145/3128128.3128141\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Swallow Swarm Optimization is a new metaheuristic of swarm intelligence based algorithm appeared by Neshat in 2013 in the continuous case. This optimization algorithm inspired by the intelligent behaviors of swallows. In This paper, we provide an adaptation of the swallow swarm optimization (SSO) to solve the famous traveling salesman problem (TSP), as one of the known combinatorial optimization problems. In order to test the performance of the algorithm described herein, we resolve a set of benchmark instances from TSPLIB library. The results obtained demonstrate that DSSO is performant than other metaheuristics methods.\",\"PeriodicalId\":362403,\"journal\":{\"name\":\"Proceedings of the 2017 International Conference on Smart Digital Environment\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2017 International Conference on Smart Digital Environment\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3128128.3128141\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 International Conference on Smart Digital Environment","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3128128.3128141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Discrete swallow swarm optimization algorithm for travelling salesman problem
Swallow Swarm Optimization is a new metaheuristic of swarm intelligence based algorithm appeared by Neshat in 2013 in the continuous case. This optimization algorithm inspired by the intelligent behaviors of swallows. In This paper, we provide an adaptation of the swallow swarm optimization (SSO) to solve the famous traveling salesman problem (TSP), as one of the known combinatorial optimization problems. In order to test the performance of the algorithm described herein, we resolve a set of benchmark instances from TSPLIB library. The results obtained demonstrate that DSSO is performant than other metaheuristics methods.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
