• Travelling salesman problem (TSP) is chosen as our targeted task. • We implemented Particle Swarm Optimization (PSO), Genetic Algorithm (GO), and Ant Colony Optimization (ACO). • Bottleneck: Different approach by PSO to TSP, PSO is particle swarm based. • Solution: Map a new concept of swap by solution exchanging nodes, using each solution in TSP to be a particle of PSO. • Solution: Mapping each route solution as a particle, optimize the swapping algorithm for nodes exchanging. • Modified how the velocity updates of each particles • Results: Best coefficient obtained, with ACO having the best overall results.