{"title":"用遗传算法求解旅行商问题的研究","authors":"Chutian Sun","doi":"10.1109/ICITM48982.2020.9080397","DOIUrl":null,"url":null,"abstract":"Travelling salesman problem is one of the most important problems in the optimization area. To solve the problem of traveling salesman, the GA (genetic algorithm) can be seen as an appropriate method. In the genetic algorithm, there are many parameters needing to be set in advance. To figure out the effects of parameters in GA, we conducted experiments with different parameters and compared the performance. In addition, we try to improve the algorithm in aspects of crossing and mutating. The improved GA obtained a better performance, showing the proposed improvement is efficient.","PeriodicalId":176979,"journal":{"name":"2020 9th International Conference on Industrial Technology and Management (ICITM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Study of Solving Traveling Salesman Problem with Genetic Algorithm\",\"authors\":\"Chutian Sun\",\"doi\":\"10.1109/ICITM48982.2020.9080397\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Travelling salesman problem is one of the most important problems in the optimization area. To solve the problem of traveling salesman, the GA (genetic algorithm) can be seen as an appropriate method. In the genetic algorithm, there are many parameters needing to be set in advance. To figure out the effects of parameters in GA, we conducted experiments with different parameters and compared the performance. In addition, we try to improve the algorithm in aspects of crossing and mutating. The improved GA obtained a better performance, showing the proposed improvement is efficient.\",\"PeriodicalId\":176979,\"journal\":{\"name\":\"2020 9th International Conference on Industrial Technology and Management (ICITM)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 9th International Conference on Industrial Technology and Management (ICITM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITM48982.2020.9080397\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 9th International Conference on Industrial Technology and Management (ICITM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITM48982.2020.9080397","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Study of Solving Traveling Salesman Problem with Genetic Algorithm
Travelling salesman problem is one of the most important problems in the optimization area. To solve the problem of traveling salesman, the GA (genetic algorithm) can be seen as an appropriate method. In the genetic algorithm, there are many parameters needing to be set in advance. To figure out the effects of parameters in GA, we conducted experiments with different parameters and compared the performance. In addition, we try to improve the algorithm in aspects of crossing and mutating. The improved GA obtained a better performance, showing the proposed improvement is efficient.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
