An improved particle swarm optimisation for solving generalised travelling salesman problem (Q391709)

Summary: We present an improved algorithm based on an improved particle swarm optimisation (PSO), and we use it to solve the generalised travelling salesman problem (GTSP). We design a novel optimised implementation approach to reduce the processing costs involved with routing in the conventional PSO and we also improve the performance of the PSO. As the main work of this paper, we use the improved algorithm in TSP based on the `generalised chromosome' coding technique of the GTSP, the above proposed method is extended for solving the GTSP. Two local search techniques are also added to the method. In order to test our methods, we use four GTSP problems for benchmarking. The results show that the method is effective for solving the GTSP problem. The proposed PSO-based algorithm could provide a suitable approach for solving the GTSP.