A discrete PSO method for generalized TSP problem

A novel discrete particle swarm optimization (PSO) method is presented to solve the generalized traveling salesman problem (GTSP). The "generalized vertex" is employed to represent the problem, by which the GTSP and TSP can be handled in a uniform style. An uncertain searching strategy and local searching techniques are also employed to accelerate the convergent speed. Numerical results show the effectiveness of the proposed method.