On the symmetric travelling salesman problem: Solution of a 120-city problem

1980 ◽  
pp. 61-77 ◽  
Author(s):  
Martin Grötschel
Keyword(s):  
Travelling Salesman Problem ◽  
Problem Solution ◽  
Travelling Salesman

scholarly journals ANT ALGORITHM FOR SOLVING TRAVELLING SALESMAN PROBLEM

2020 ◽  
Vol 7 (2) ◽  
pp. 010-017
Author(s):  
E. A. Kaliberda ◽  
◽  
M. Yu. Gunenkov ◽  
D. S. Dyusekenov ◽  
I. V. Fedotova ◽  
...  
Keyword(s):  
Input Data ◽  
Travelling Salesman Problem ◽  
Dependency Graph ◽  
Software Implementation ◽  
Ant Algorithm ◽  
Problem Solution ◽  
Travelling Salesman ◽  
Time Efficiency ◽  
Theoretical Overview

The paper provides a brief theoretical overview of existing approaches to solving travelling salesman problem. The software implementation of the problem solution using the ant algorithm is performed. The analysis of the time efficiency of the algorithm on different volumes of input data is carried out. Dependency graph is plotted. Further directions of studying this algorithm are determined.

scholarly journals Travelling Salesman Problem Solution Based-on Grey Wolf Algorithm over Hypercube Interconnection Network

2018 ◽  
Vol 12 (8) ◽  
pp. 142 ◽  
Author(s):  
Ameen Shaheen ◽  
Azzam Sleit ◽  
Saleh Al-Sharaeh
Keyword(s):  
Optimization Problems ◽  
Interconnection Network ◽  
Travelling Salesman Problem ◽  
Benchmark Problems ◽  
Grey Wolf Optimizer ◽  
Gray Wolf ◽  
Problem Solution ◽  
Grey Wolf ◽  
Travelling Salesman ◽  
Complete Problems

Travelling Salesman Problem (TSP) is one of the most popular NP-complete problems for the researches in the field of computer science which focused on optimization. TSP goal is to find the minimum path between cities with a condition of each city must to visit exactly once by the salesman. Grey Wolf Optimizer (GWO) is a new swarm intelligent optimization mechanism where it success in solving many optimization problems. In this paper, a parallel version of GWO for solving the TSP problem on a Hypercube Interconnection Network is presented. The algorithm has been compared to the alternative algorithms. Algorithms have been evaluated analytically and by simulations in terms of execution time, optimal cost, parallel runtime, speedup and efficiency. The algorithms are tested on a number of benchmark problems and found parallel Gray wolf algorithm is promising in terms of speed-up, efficiency and quality of solution in comparison with the alternative algorithms.   

ABOUT THE ALGORITHMS OF TRAVELLING SALESMAN PROBLEM SOLUTION ON THE INTERNET

2019 ◽  
Vol 68 ◽  
pp. 37-43
Author(s):  
V. M. Kureichik ◽  
◽  
Y. A. Logunova ◽  
◽  
◽  
...  
Keyword(s):  
Travelling Salesman Problem ◽  
The Internet ◽  
Problem Solution ◽  
Travelling Salesman

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