Solving Travelling Salesman Problem using Discreet Social Group Optimization

Abstract

In this paper, a modified version of social group optimization (SGO) has been proposed i.e discreet social group optimization (DSGO), to find out the optimal path for travelling salesman problem (TSP), which is one of the well known NP-Hard problems. Its performance has been compared with Genetic Algorithm (GA) and Discrete Particle Swarm Optimization (DPSO) and the results found are competitive. It is observed that DSGO converges faster than DPSO and GA and also provides more optimal results for bigger size data.