Chaotic hybrid discrete bat algorithm for traveling salesman problem

In view of some problems,like slow convergence speed and low constringency rate,arising during the process of applying discrete bat algorithms to solve travelling salesman problem,a chaotic hybrid discrete bat algorithm is proposed.The proposed algorithm adopts chaotic initialization strategy to improve the capability of optimization,and the 2-Opt to enhance the capability of local search and to speed up the convergence speed.A large amount of simulations show that the algorithm can achieve their solutions rapidly for some small scale traveling salesman problems,and obtain their solutions in a relatively short time with the error less than 0.4% for large ones.