A discrete invasive weed optimization algorithm for solving traveling salesman p

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 improve