{"title":"基于CLARANS启发式的k行修理工问题求解方法","authors":"Amira Hmayer, Imen Ome Ezzine","doi":"10.1109/ICADLT.2013.6568515","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an approach heuristic based on a mathematical approach for resolution of K-Traveling Repairman Problem 'K-TRP'. This approach is based on the heuristic classification method CLARANS which allows to convert a K-TRP in small problems containing a single repairman. After grouping, an optimized route is generated for every repairman in his indicated group. Computational results prove the efficiency of the proposed approach.","PeriodicalId":269509,"journal":{"name":"2013 International Conference on Advanced Logistics and Transport","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"CLARANS heuristic based approch for the k-traveling repairman problem\",\"authors\":\"Amira Hmayer, Imen Ome Ezzine\",\"doi\":\"10.1109/ICADLT.2013.6568515\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an approach heuristic based on a mathematical approach for resolution of K-Traveling Repairman Problem 'K-TRP'. This approach is based on the heuristic classification method CLARANS which allows to convert a K-TRP in small problems containing a single repairman. After grouping, an optimized route is generated for every repairman in his indicated group. Computational results prove the efficiency of the proposed approach.\",\"PeriodicalId\":269509,\"journal\":{\"name\":\"2013 International Conference on Advanced Logistics and Transport\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Advanced Logistics and Transport\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICADLT.2013.6568515\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Advanced Logistics and Transport","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICADLT.2013.6568515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
CLARANS heuristic based approch for the k-traveling repairman problem
In this paper, we propose an approach heuristic based on a mathematical approach for resolution of K-Traveling Repairman Problem 'K-TRP'. This approach is based on the heuristic classification method CLARANS which allows to convert a K-TRP in small problems containing a single repairman. After grouping, an optimized route is generated for every repairman in his indicated group. Computational results prove the efficiency of the proposed approach.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
