带固定半径近邻搜索 3-opt 的离散烟花 算法求解旅行商问题.

The traditional fireworks algorithm has slow convergence speed and low precision when solving large-scale discrete problems. Aiming at the characteristics of travelling salesman problem, this paper proposed a discrete fireworks algorithm with fixed radius nearest-neighbor search 3 -opt. It discretized and improved the proposed algorithm based on the basic fireworks algorithm, where adopted the integer coding path representation method to represent the solution of the travelling salesman problem, as well as designed the explosion operator and the Gauss mutation operator of the algorithm for discretization solution. To enhance local search ability of the algorithm, the algorithm proposed implements 3-opt local search to strengthen search ability of the algorithm, and introduced the fixed radius of neighbor search and don't-look-bits strategy to improve the efficiency of the algorithm. The experiments indicate that the proposed algorithm solves travelling salesman problem effectively . The discrete fireworks operator proposed is superior to the traditional fireworks operator in global convergence ability, convergence accuracy, solution time and stability . The average costs of the solutions of the algorithms for all benchmark instances probed have an overall deviation in only 0. 002% from those of the best known solutions, which is lower than those of all comparing algorithms. [ABSTRACT FROM AUTHOR]