D. Nuraiman, F. Ilahi, Yushinta Dewi, E. A. Z. Hamidi
{"title":"基于最近邻算法和2-Opt算法的旅行商问题混合求解方法","authors":"D. Nuraiman, F. Ilahi, Yushinta Dewi, E. A. Z. Hamidi","doi":"10.1109/ICWT.2018.8527878","DOIUrl":null,"url":null,"abstract":"Traveling salesman problem has been one of the mostly studied problems in combinatorial optimization. This paper proposes a new hybrid method combining the nearest neighbor algorithm and the 2-opt algorithm. The performance of this method has been tested to several benchmark problems from TSPLIB involving 11 instances of symmetric problems and three instances of asymmetric problems with various number of nodes from 17 to 783 nodes. The results show that the hybrid method can reduce the relative error significantly compared to the nearest neighbor algorithm only.","PeriodicalId":356888,"journal":{"name":"2018 4th International Conference on Wireless and Telematics (ICWT)","volume":"9 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A New Hybrid Method Based on Nearest Neighbor Algorithm and 2-Opt Algorithm for Traveling Salesman Problem\",\"authors\":\"D. Nuraiman, F. Ilahi, Yushinta Dewi, E. A. Z. Hamidi\",\"doi\":\"10.1109/ICWT.2018.8527878\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traveling salesman problem has been one of the mostly studied problems in combinatorial optimization. This paper proposes a new hybrid method combining the nearest neighbor algorithm and the 2-opt algorithm. The performance of this method has been tested to several benchmark problems from TSPLIB involving 11 instances of symmetric problems and three instances of asymmetric problems with various number of nodes from 17 to 783 nodes. The results show that the hybrid method can reduce the relative error significantly compared to the nearest neighbor algorithm only.\",\"PeriodicalId\":356888,\"journal\":{\"name\":\"2018 4th International Conference on Wireless and Telematics (ICWT)\",\"volume\":\"9 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 4th International Conference on Wireless and Telematics (ICWT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWT.2018.8527878\",\"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 4th International Conference on Wireless and Telematics (ICWT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWT.2018.8527878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Hybrid Method Based on Nearest Neighbor Algorithm and 2-Opt Algorithm for Traveling Salesman Problem
Traveling salesman problem has been one of the mostly studied problems in combinatorial optimization. This paper proposes a new hybrid method combining the nearest neighbor algorithm and the 2-opt algorithm. The performance of this method has been tested to several benchmark problems from TSPLIB involving 11 instances of symmetric problems and three instances of asymmetric problems with various number of nodes from 17 to 783 nodes. The results show that the hybrid method can reduce the relative error significantly compared to the nearest neighbor algorithm only.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
