Edson Lopes da Silva Junior, V. S. Silva, L. B. Gonçalves, L. Moreno, S. Soares
{"title":"禁忌聚类旅行商问题的一种高效算法","authors":"Edson Lopes da Silva Junior, V. S. Silva, L. B. Gonçalves, L. Moreno, S. Soares","doi":"10.1109/BRACIS.2019.00058","DOIUrl":null,"url":null,"abstract":"This paper addresses the Tabu Clustered Traveling Salesman Problem, a recent variation of TSP motivated by a real-life application in the management of satellite network. In the TCTSP, nodes are split into two distinct partitions, named tabus and clusters. The TCTSP consists of finding a minimum cost cycle that contains exactly one node of each tabu and visits nodes of the same cluster consecutively. We propose a reactive GRASP heuristic that is competitive in terms of both time efficiency and solution quality in comparison with the literature results.","PeriodicalId":335206,"journal":{"name":"Brazilian Conference on Intelligent Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Efficient Algorithm for the Tabu Clustered Traveling Salesman Problem\",\"authors\":\"Edson Lopes da Silva Junior, V. S. Silva, L. B. Gonçalves, L. Moreno, S. Soares\",\"doi\":\"10.1109/BRACIS.2019.00058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the Tabu Clustered Traveling Salesman Problem, a recent variation of TSP motivated by a real-life application in the management of satellite network. In the TCTSP, nodes are split into two distinct partitions, named tabus and clusters. The TCTSP consists of finding a minimum cost cycle that contains exactly one node of each tabu and visits nodes of the same cluster consecutively. We propose a reactive GRASP heuristic that is competitive in terms of both time efficiency and solution quality in comparison with the literature results.\",\"PeriodicalId\":335206,\"journal\":{\"name\":\"Brazilian Conference on Intelligent Systems\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Brazilian Conference on Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BRACIS.2019.00058\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Brazilian Conference on Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2019.00058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Algorithm for the Tabu Clustered Traveling Salesman Problem
This paper addresses the Tabu Clustered Traveling Salesman Problem, a recent variation of TSP motivated by a real-life application in the management of satellite network. In the TCTSP, nodes are split into two distinct partitions, named tabus and clusters. The TCTSP consists of finding a minimum cost cycle that contains exactly one node of each tabu and visits nodes of the same cluster consecutively. We propose a reactive GRASP heuristic that is competitive in terms of both time efficiency and solution quality in comparison with the literature results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
