A discrete invasive weed optimization algorithm for solving traveling salesman problem

The Traveling Salesman Problem (TSP) is one of the typical NP-hard problems. Efficient algorithms for the TSP have been the focus on academic circles at all times. This article proposes a discrete invasive weed optimization (DIWO) to solve TSP. Firstly, weeds individuals encode positive integer, on the basis that the normal distribution of the IWO does not change, and then calculate the fitness value of the weeds individuals. Secondly, the 3-Opt local search operator is used. Finally, an improved complete 2-Opt (I2Opt) is selected as a second local search operator for solve TSP. A benchmarks problem selected from TSPLIB is used to test the algorithm, and the results show that the DIWO algorithm proposed in this article can achieve to results closed to the theoretical optimal values within a reasonable period of time, and has strong robustness. (C) 2014 Elsevier B.V. All rights reserved.