Table of Contents
Game Theory
Volume 2014, Article ID 696945, 6 pages
Research Article

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

Carlo Cattaneo University (LIUC), 21053 Castellanza, Italy

Received 30 September 2014; Revised 27 November 2014; Accepted 29 November 2014; Published 14 December 2014

Academic Editor: X. Henry Wang

Copyright © 2014 Nicola Besozzi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.