Particle swarm optimization based on neighborhood encoding for traveling salesman problem

While applying particle swarm optimization to solving traveling salesman problem, some encoding schemes can´t utilize well flying character. Particle swarm optimization based on neighborhood encoding for solving traveling salesman problem is put forward in this paper. Scheme of neighborhood encoding makes particles flying efficaciously to interesting region, and eventually makes particle swarm optimization converging with higher efficiency than those utilizing other encoding schemes. Simulation results indicate that new encoding scheme is efficacious.