ICAR Research Data Repository for Knowledge Management
Solving Travelling Salesman Problem using Discreet Social Group Optimization
NOPR - NISCAIR Online Periodicals Repository
View Archive Info| Field | Value | |
| Title |
Solving Travelling Salesman Problem using Discreet Social Group Optimization
|
|
| Creator |
Verma, Sumit
Jena, Junali Jasmine Satapathy, Suresh Chandra Rout, Minakhi |
|
| Subject |
Travelling salesman problem
DSGO Optimal path |
|
| Description |
928-930
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. |
|
| Date |
2020-10-13T08:31:49Z
2020-10-13T08:31:49Z 2020-10 |
|
| Type |
Article
|
|
| Identifier |
0975-1084 (Online); 0022-4456 (Print)
http://nopr.niscair.res.in/handle/123456789/55473 |
|
| Language |
en_US
|
|
| Rights |
 CC Attribution-Noncommercial-No Derivative Works 2.5 India
|
|
| Publisher |
NISCAIR-CSIR, India
|
|
| Source |
JSIR Vol.79(10) [October 2020]
|
|