A comparative study of Travelling Salesman Problem and solution using different algorithm design techniques

2016 ◽  
Author(s):  
Tapan Kumar Hazra ◽  
Ankan Hore
Keyword(s):  
Comparative Study ◽  
Travelling Salesman Problem ◽  
Algorithm Design ◽  
Travelling Salesman ◽  
Design Techniques

scholarly journals A COMPARATIVE STUDY OF VARIOUS METHODS OF ANN FOR SOLVING TSP PROBLEM

2013 ◽  
Vol 4 (1) ◽  
pp. 19-28 ◽  
Author(s):  
Sharadindu Roy ◽  
Prof Samer Sen Sarma ◽  
Soumyadip Chakravorty ◽  
Suvodip Maity
Keyword(s):  
Comparative Study ◽  
Optimization Problem ◽  
Travelling Salesman Problem ◽  
Recurrent Network ◽  
Hopfield Network ◽  
The Other ◽  
Self Organization ◽  
Travelling Salesman ◽  
Combinational Optimization ◽  
Fully Connected

Abstract This paper represents TSP (Travelling Salesman Problem) by using Artificial Neural Networks.A comparative study of various methods of ANN is shown here for solving TSP problem.The Travelling Salesman Problem is a classical combinational optimization problem, which is a simple to state but very difficult to solve. This problem is to find the shortest possible tour through a set of N vertices so that each vertex is visited exactly once. TSP can be solved by Hopfield Network, Self-organization Map, and Simultaneous Recurrent Network. Hopfield net is a fully connected network, where every vertex is connected with each other forwardly and backwardly. So starting the walk from a vertex we can travel all the other vertex exactly once and return to starting vertex again.

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.

scholarly journals Tourist Route Optimization in the Context of Covid-19 Pandemic

2021 ◽  
Vol 13 (10) ◽  
pp. 5492
Author(s):  
Cristina Maria Păcurar ◽  
Ruxandra-Gabriela Albu ◽  
Victor Dan Păcurar
Keyword(s):  
Travelling Salesman Problem ◽  
Route Planning ◽  
Route Optimization ◽  
Travelling Salesman ◽  
Social Distancing ◽  
Tourist Destinations ◽  
Innovative Method ◽  
The Social ◽  
Immediate Response

The paper presents an innovative method for tourist route planning inside a destination. The necessity of reorganizing the tourist routes within a destination comes as an immediate response to the Covid-19 crisis. The implementation of the method inside tourist destinations can bring an important advantage in transforming a destination into a safer one in times of Covid-19 and post-Covid-19. The existing trend of shortening the tourist stay length has been accelerated while the epidemic became a pandemic. Moreover, the wariness for future pandemics has brought into spotlight the issue of overcrowded attractions inside a destination at certain moments. The method presented in this paper proposes a backtracking algorithm, more precisely an adaptation of the travelling salesman problem. The method presented is aimed to facilitate the navigation inside a destination and to revive certain less-visited sightseeing spots inside a destination while facilitating conformation with the social distancing measures imposed for Covid-19 control.

A column-and-row generation approach for the flying sidekick travelling salesman problem

2021 ◽  
Vol 124 ◽  
pp. 102913
Author(s):  
Maurizio Boccia ◽  
Adriano Masone ◽  
Antonio Sforza ◽  
Claudio Sterle
Keyword(s):  
Travelling Salesman Problem ◽  
Travelling Salesman
Sign in / Sign up

Export Citation Format

Share Document