Particle swarm optimization algorithm based on same side keeping and elitism

A modified particle swarm optimization algorithm is proposed to deal with combinatorial optimization problem. This algorithm is combined with traveling salesman problem. Methods such as technology of random exchange sequence, same side keeping and elitism are adopted. The particle swarm optimization algorithm based on same side keeping and elitism can be applied to discrete problem and has strong ability of global searching. Traveling Salesman Problem with 14 nodes and Chinese Traveling Salesman Problem demonstrate the efficiency of this algorithm.