旅行商问题的混沌混合离散蝙蝠算法

摘要

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 solu-tions in a relatively short time with the error less than 0. 4% for large ones.%针对现有离散蝙蝠算法在求解旅行商问题时存在的收敛速度较慢、收敛率不高等问题，提出了混沌混合离散蝙蝠算法．该算法采用混沌初始化策略提高算法的寻优能力，引入2-Opt技术增强算法的局部搜索能力、加快算法的收敛速度．大量的仿真实验表明：所提出的算法在求解小规模TSP时能快速收敛到已知最优解；在求解大规模TSP时能在较短的时间内收敛到偏差0．4％以内的最优解．