Proposed new heuristic algorithm for travelling salesman problem based from minimum link

2016 ◽  
Author(s):  
Christian ◽  
Wahid Miftahul Ashari ◽  
Nana Rachmana Syambas
Keyword(s):  
Heuristic Algorithm ◽  
Travelling Salesman Problem ◽  
Travelling Salesman

Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem

2018 ◽  
Vol 97 ◽  
pp. 1-17 ◽  
Author(s):  
Hipólito Hernández-Pérez ◽  
Juan José Salazar-González ◽  
Beatriz Santos-Hernández
Keyword(s):  
Heuristic Algorithm ◽  
Travelling Salesman Problem ◽  
Pickup And Delivery ◽  
Travelling Salesman

scholarly journals Two phase heuristic algorithm for the multiple-travelling salesman problem

2017 ◽  
Vol 22 (19) ◽  
pp. 6567-6581 ◽  
Author(s):  
Xiaolong Xu ◽  
Hao Yuan ◽  
Mark Liptrott ◽  
Marcello Trovati
Keyword(s):  
Heuristic Algorithm ◽  
Travelling Salesman Problem ◽  
Travelling Salesman ◽  
Two Phase ◽  
Multiple Travelling Salesman Problem

scholarly journals Can the Agent with Limited Information Solve Travelling Salesman Problem?

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-6
Author(s):  
Tomoko Sakiyama ◽  
Ikuo Arizono
Keyword(s):  
Heuristic Algorithm ◽  
Optimization Problems ◽  
Travelling Salesman Problem ◽  
The Other ◽  
Time Dependent ◽  
Critical Properties ◽  
Limited Information ◽  
Travelling Salesman ◽  
Benchmark Data ◽  
Benchmark Datasets

Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem). In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites. Under the circumstances, the agent occasionally ignores the NN method (choosing the nearest site from current site) and chooses the other site far from current site. It is dependent on relative distances between the nearest site and the other site. Our algorithm performs well in symmetric TSP and asymmetric TSP (time-dependent TSP) conditions compared with the NN algorithm using some TSP benchmark datasets from the TSPLIB. Here, symmetric TSP means common TSP, where costs between sites are symmetric and time-homogeneous. On the other hand, asymmetric TSP means TSP where costs between sites are time-inhomogeneous. Furthermore, the agent exhibits critical properties in some benchmark data. These results suggest that the agent performs adaptive travel using limited information. Our results might be applicable to nonclairvoyant optimization problems.

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