Record Details

<p>Solving Travelling Salesman Problem using Discreet Social Group Optimization</p>

Online Publishing @ NISCAIR

View Archive Info
 
 
Field Value
 
Authentication Code dc
 
Title Statement <p>Solving Travelling Salesman Problem using Discreet Social Group Optimization</p>
 
Added Entry - Uncontrolled Name Verma, Sumit ; School of Computer Engineering, Kalinga Institute of Industrial Technology, Bhubaneswar, India
Jena, Junali Jasmine; School of Computer Engineering, Kalinga Institute of Industrial Technology, Bhubaneswar, India
Satapathy, Suresh Chandra; School of Computer Engineering, Kalinga Institute of Industrial Technology, Bhubaneswar, India
Rout, Minakhi ; School of Computer Engineering, Kalinga Institute of Industrial Technology, Bhubaneswar, India
 
Uncontrolled Index Term Travelling salesman problem; DSGO; Optimal path
 
Summary, etc. <p>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.</p>
 
Publication, Distribution, Etc. Journal of Scientific and Industrial Research (JSIR)
2021-01-02 22:21:44
 
Electronic Location and Access application/pdf
http://op.niscair.res.in/index.php/JSIR/article/view/43567
 
Data Source Entry Journal of Scientific and Industrial Research (JSIR); ##issue.vol## 79, ##issue.no## 10 (20)
 
Language Note en