Solving the dynamic traveling salesman game problem

2010 ◽  
Vol 46 (5) ◽  
pp. 718-723 ◽  
Author(s):  
A. A. Belousov ◽  
Yu. I. Berdyshev ◽  
A. G. Chentsov ◽  
A. A. Chikrii
Keyword(s):  
Game Problem ◽  
Traveling Salesman ◽  
Traveling Salesman Game

scholarly journals The Traveling Salesman Game for Cost Allocation: The Case Study of the Bus Service in Castellanza

Game Theory ◽  
2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Nicola Besozzi ◽  
Luca Ruschetti ◽  
Chiara Rossignoli ◽  
Fernanda Strozzi
Keyword(s):  
Cost Allocation ◽  
City Council ◽  
Traveling Salesman ◽  
Optimal Route ◽  
Transportation Service ◽  
Bus Service ◽  
The Cost ◽  
The City ◽  
Traveling Salesman Game

This paper studies cost allocation for the bus transportation service in Castellanza, a small town (14,000 inhabitants ca.) close to Varese, Italy. Carlo Cattaneo University (LIUC) is one of the promoters and funders of this service, together with the City Council and other private agents. The case study is first analysed as a traveling salesman problem (TSP) to find the optimal route. Then the traveling salesman game (TSG) is introduced, where the bus stops are associated with the players of a cooperative game, thus allowing the study of possible allocations of the total cost among them. The optimal route is found by the Branch and Bound algorithm. The Shapley vector and the separable and nonseparable cost are the methods used to allocate the cost of the optimal route among players.

K-means Clustering Algorithm and Meta-heuristics for Multiple Traveling Salesman Problems

2009 ◽  
Vol 4 (2) ◽  
pp. 16-32
Author(s):  
R. Nallusamy ◽  
K. Duraiswamy ◽  
R. Dhanalaksmi ◽  
P. Parthiban
Keyword(s):  
Clustering Algorithm ◽  
Traveling Salesman ◽  
Traveling Salesman Problems

Grafos hamiltonianos aplicado al turismo de Panamá

2019 ◽  
Vol 7 (1) ◽  
pp. 109-113
Author(s):  
Julio Trujillo
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman

Un problema clásico de Teoría de Grafos es encontrar un camino que pase por varios puntos, sólo una vez, empezando y terminando en un lugar (camino hamiltoniano). Al agregar la condición de que sea la ruta más corta, el problema se convierte uno de tipo TSP (Traveling Salesman Problem). En este trabajo nos centraremos en un problema de tour turístico por la ciudad de Panamá, transformándolo a un problema de grafo de tal manera que represente la situación planteada.

Sign in / Sign up

Export Citation Format

Share Document