{"title":"基于主客场交换邻域的镜像巡回赛问题的启发式算法","authors":"Bruno Guilera, Italo Teixeira, T. Januario","doi":"10.1109/CLEI.2018.00028","DOIUrl":null,"url":null,"abstract":"In this paper we present a detailed experimental analysis of the existing neighborhoods in the literature using a few quality criteria and propose new heuristics for the Mirrored Traveling Tournament Problem. Based on the Home-Away Swap, the proposed heuristics are able to search the solution space from an infeasible solution and obtaining a feasible one in the end. We also describe a estrategy for reduce the amount of visited neighborhoods in the local search process without drastically affect the solution, consequently we managed to obtain feasible solutions with reduced computation time, as shown through empirical analysis.","PeriodicalId":379986,"journal":{"name":"2018 XLIV Latin American Computer Conference (CLEI)","volume":"165 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Heuristics for the Mirrored Tournament Traveling Tournament Problem Based on the Home-Away Swap Neighborhood\",\"authors\":\"Bruno Guilera, Italo Teixeira, T. Januario\",\"doi\":\"10.1109/CLEI.2018.00028\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a detailed experimental analysis of the existing neighborhoods in the literature using a few quality criteria and propose new heuristics for the Mirrored Traveling Tournament Problem. Based on the Home-Away Swap, the proposed heuristics are able to search the solution space from an infeasible solution and obtaining a feasible one in the end. We also describe a estrategy for reduce the amount of visited neighborhoods in the local search process without drastically affect the solution, consequently we managed to obtain feasible solutions with reduced computation time, as shown through empirical analysis.\",\"PeriodicalId\":379986,\"journal\":{\"name\":\"2018 XLIV Latin American Computer Conference (CLEI)\",\"volume\":\"165 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 XLIV Latin American Computer Conference (CLEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLEI.2018.00028\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 XLIV Latin American Computer Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI.2018.00028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Heuristics for the Mirrored Tournament Traveling Tournament Problem Based on the Home-Away Swap Neighborhood
In this paper we present a detailed experimental analysis of the existing neighborhoods in the literature using a few quality criteria and propose new heuristics for the Mirrored Traveling Tournament Problem. Based on the Home-Away Swap, the proposed heuristics are able to search the solution space from an infeasible solution and obtaining a feasible one in the end. We also describe a estrategy for reduce the amount of visited neighborhoods in the local search process without drastically affect the solution, consequently we managed to obtain feasible solutions with reduced computation time, as shown through empirical analysis.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
