Please use this identifier to cite or link to this item: http://nopr.niscair.res.in/handle/123456789/55473
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVerma, Sumit-
dc.contributor.authorJena, Junali Jasmine-
dc.contributor.authorSatapathy, Suresh Chandra-
dc.contributor.authorRout, Minakhi-
dc.date.accessioned2020-10-13T08:31:49Z-
dc.date.available2020-10-13T08:31:49Z-
dc.date.issued2020-10-
dc.identifier.issn0975-1084 (Online); 0022-4456 (Print)-
dc.identifier.urihttp://nopr.niscair.res.in/handle/123456789/55473-
dc.description928-930en_US
dc.description.abstractIn 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.en_US
dc.language.isoen_USen_US
dc.publisherNISCAIR-CSIR, Indiaen_US
dc.rights CC Attribution-Noncommercial-No Derivative Works 2.5 Indiaen_US
dc.sourceJSIR Vol.79(10) [October 2020]en_US
dc.subjectTravelling salesman problemen_US
dc.subjectDSGOen_US
dc.subjectOptimal pathen_US
dc.titleSolving Travelling Salesman Problem using Discreet Social Group Optimizationen_US
dc.typeArticleen_US
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.