{"title":"Integrating Relative Coordinates with Simulated Annealing to Solve a Traveling Salesman Problem","authors":"Xiaojun Liu, Bin Zhang, Fangying Du","doi":"10.1109/CSO.2014.39","DOIUrl":null,"url":null,"abstract":"Traveling salesman problem is one of most famous problems in Combinatorial Optimization. This paper presents a case study of ANJI-CEVA AUTOMOTIVE LOGISTICS CO., LTD. We formulated their problem as a traveling salesman problem and, with the use of relative coordinates of the locations as problem parameters, solved the traveling salesman problem by simulated annealing and our final solution is shown to be a circular path.","PeriodicalId":174800,"journal":{"name":"2014 Seventh International Joint Conference on Computational Sciences and Optimization","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Joint Conference on Computational Sciences and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2014.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Traveling salesman problem is one of most famous problems in Combinatorial Optimization. This paper presents a case study of ANJI-CEVA AUTOMOTIVE LOGISTICS CO., LTD. We formulated their problem as a traveling salesman problem and, with the use of relative coordinates of the locations as problem parameters, solved the traveling salesman problem by simulated annealing and our final solution is shown to be a circular path.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
