期刊名称:International Journal of Grid and Distributed Computing
印刷版ISSN:2005-4262
出版年度:2015
卷号:8
期号:3
页码:359-370
DOI:10.14257/ijgdc.2015.8.3.33
出版社:SERSC
摘要:This paper presents a hybrid algorithm for traveling salesman problem. The algorithm is a combination of the genetic algorithm and simulated annealing algorithm; in other words, it is a hybrid algorithm. The combination overcomes the deficiencies of the two algorithms when acting separately. The real distance between customers has been used on the basis of geographical information system (GIS) in order to make the result more suitable in real-life. The algorithm has tested on the examples of international standards. We made a comparison with the result of second nearest neighbor algorithm and genetic optimization algorithm. The test showed that the algorithm proposed in this paper has improved the results.
关键词:traveling salesman problem; genetic-simulated annealing algorithm; ; geographical information system