scholarly journals A Study and Performance Evaluation of Various Optimization Techniques for Travelling Salesman Problem

2019 ◽  
Vol 7 (5) ◽  
pp. 1976-1986
Author(s):  
Gunjan Choudhary
Keyword(s):  
Performance Evaluation ◽  
Travelling Salesman Problem ◽  
Optimization Techniques ◽  
Travelling Salesman ◽  
And Performance

scholarly journals Comparative Study on Travelling Salesman Problem

2021 ◽  
Vol 23 (07) ◽  
pp. 853-857
Author(s):  
Yatharth Srivastav ◽  
◽  
J.K. Saini ◽  
Keyword(s):  
Comparative Study ◽  
Travelling Salesman Problem ◽  
Optimization Algorithms ◽  
Minimum Cost ◽  
Optimization Techniques ◽  
Travelling Salesman

Travelling Salesman Problem (TSP) is a kind of LPP to find a minimum cost sequence in order to travel in each set of cities in a way that starting as well as ending should be on the same city and each city is visited exactly one time. In this paper, we will compare different optimization algorithms working principles, and we will also discuss the advantages and limitations of all the optimization techniques.

Sign in / Sign up

Export Citation Format

Share Document