Please use this identifier to cite or link to this item:
Title: Solving Travelling Salesman Problem using Discreet Social Group Optimization
Authors: Verma, Sumit
Jena, Junali Jasmine
Satapathy, Suresh Chandra
Rout, Minakhi
Keywords: Travelling salesman problem;DSGO;Optimal path
Issue Date: Oct-2020
Publisher: NISCAIR-CSIR, India
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.
Page(s): 928-930
ISSN: 0975-1084 (Online); 0022-4456 (Print)
Appears in Collections:JSIR Vol.79(10) [October 2020]

Files in This Item:
File Description SizeFormat 
JSIR 79(10) 928-930.pdf231.62 kBAdobe PDFView/Open

Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.