摘要

Weeds optimization algorithm (IWO) is a very innovative and efficient global optimization algorithm, this algorithm simulates natural behavior of weeds cloning and reproduction, which has advantage of good robustness, adaptive and randomness characteristics. A discrete hybrid invasive weed optimization algorithm (DHIWO) is designed to tackle the traveling salesman problem (TSP). Based on the characteristics of combinatorial optimization problem, this paper disperses the distribution of the offspring. In order to restrain premature stagnation, single point ordered and swap mutation operator of the genetic algorithm are applied to the new algorithm. The experiment results show that the algorithm, with the smaller populations and the fewer number of iterations, can produce good results, compared with the particle swarm optimization algorithm for TSP.

  • 出版日期2013

全文