Adaptive Neighborhood Search's DGSO Applied to Travelling Saleman Problem

In order to further study the effectiveness and applicability of the glowworm swarm optimization algorithm, this paper proposed a discrete glowworm swarm optimization algorithm with an adaptive neighborhood search, and used it to solve traveling salesman problem (TSP). Based on the analysis and optimization of the different genetic operations, a new adaptive DGSO algorithm is presented (ADGSO), which is effective for both local search and global search. And we defined a new kind of glowworm, which can adjust the flight length of particles by self-adapting. By solving the different instances of TSP, experimental results indicate that ADGSO has a remarkable quality of the global convergence reliability and convergence velocity. It solved the problems of traditional DGSO algorithm “premature”. Unlike existing TSP approaches that often aggregate multiple criteria and constraints into a compromise function, the proposed ADGSO optimizes all routing constraints and objectives simultaneously, which improves the routing solutions in many aspects, such as lower routing cost, wider scattering area and better convergence trace. The ADGSO is applied to solve the TSP, which yields solutions better than or competitive as compared to the best solutions published in literature.