scholarly journals The Solution of some 100-city Travelling Salesman Problems

2021 ◽  
pp. 100017
Author(s):  
A. Land
Keyword(s):  
Travelling Salesman

SOLVING FUZZY ASSIGNMENT AND FUZZY TRAVELLING SALESMAN PROBLEMS USING R SOFTWARE

2020 ◽  
Vol 9 (11) ◽  
pp. 9931-9938
Author(s):  
M. Kaliyappan ◽  
S. Dhanasekar ◽  
N. Mohana
Keyword(s):  
Travelling Salesman ◽  
R Software

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

scholarly journals Adaptive Gene Level Mutation

Algorithms ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 16
Author(s):  
Jalal Al-afandi ◽  
Horváth András
Keyword(s):  
Genetic Algorithms ◽  
Stochastic Optimization ◽  
Specific Problem ◽  
Traditional Approach ◽  
Fitness Function ◽  
Optimization Methods ◽  
Analytic Solutions ◽  
Problem Representation ◽  
Travelling Salesman ◽  
Gene Level

Genetic Algorithms are stochastic optimization methods where solution candidates, complying to a specific problem representation, are evaluated according to a predefined fitness function. These approaches can provide solutions in various tasks even, where analytic solutions can not be or are too complex to be computed. In this paper we will show, how certain set of problems are partially solvable allowing us to grade segments of a solution individually, which results local and individual tuning of mutation parameters for genes. We will demonstrate the efficiency of our method on the N-Queens and travelling salesman problems where we can demonstrate that our approach always results faster convergence and in most cases a lower error than the traditional approach.

Sign in / Sign up

Export Citation Format

Share Document