Chaotic ant swarm for the traveling salesman problem |
| |
| Authors: | Zhen Wei Fangzhen Ge Yang Lu Lixiang Li Yixian Yang |
| |
| Institution: | 1.School of Computer and Information,Hefei University of Technology,Hefei,P.R. China;2.School of Computer Science and Technology,Huaibei Normal University,Huaibei,P.R. China;3.Information Security Center, State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing,P.R. China |
| |
| Abstract: | Chaotic ant swarm (CAS) is an optimization algorithm based on swarm intelligence theory, which has been applied to find the
global optimum solution in continuous search space. However, it is not able to solve the combinational optimization problem
directly, e.g., the traveling salesman problem (TSP). To tackle this problem, we propose a new method to solve the traveling
salesman problem based on chaotic ant swarm, CAS-TSP for short. The CAS-TSP is developed by introducing a mapping from continuous
space to discrete space, reverse operator and crossover operator into the CAS. Computer simulations demonstrate that the CAS-TSP
is capable of generating optimal solution to instances of the TSPLIB in almost all test problems of sizes up to 150. Also
a comparative computational study shows that this CAS-TSP algorithm is an efficient tool for solving TSP and this heuristic
is competitive also with other heuristics. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
