scholarly journals Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem

2008 ◽  
pp. 123-134 ◽  
Author(s):  
Antonio Augusto Chaves ◽  
Luiz Antonio Nogueira Lorena
Keyword(s):  
Travelling Salesman Problem ◽  
Travelling Salesman ◽  
Hybrid Metaheuristic ◽  
Prize Collecting

scholarly journals A branch-and-cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem

2020 ◽  
Author(s):  
Glaubos Climaco ◽  
Luidi Simonetti ◽  
Isabel Rosseti
Keyword(s):  
Traveling Salesman Problem ◽  
Travelling Salesman Problem ◽  
Branch And Cut ◽  
Traveling Salesman ◽  
Minimum Amount ◽  
Travelling Salesman ◽  
Travel Costs ◽  
Prize Collecting

The Prize Collecting Traveling Salesman Problem (PCTSP) represents a generalization of the well-known Traveling Salesman Problem. The PCTSP can be associated with a salesman that collects a prize in each visited city and pays a penalty for each unvisited city, with travel costs among the cities. The objective is to minimize the sum of the costs of the tour and penalties, while collecting a minimum amount of prize. This paper suggests MIP-based heuristics and a branch-and-cut algorithm to solve the PCTSP. Experiments were conducted with instances of the literature, and the results of our methods turned out to be quite satisfactory.

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