Please use this identifier to cite or link to this item: http://arl.liuc.it/dspace/handle/2468/3962
Title: The traveling salesman game for cost allocation: the case study of the bus service in Castellanza
Authors: Besozzi, Nicola
Ruschetti, Luca
Rossignoli, Chiara
Strozzi, Fernanda
Issue Date: 2014
Publisher: Hindawi publishing corporation
Bibliographic citation: Besozzi Nicola, et al. (2014), The traveling salesman game for cost allocation: the case study of the bus service in Castellanza. In: Game theory, vol. 2014, p. 1-6.
Abstract: 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.
URI: http://arl.liuc.it/dspace/handle/2468/3962
Journal/Book: Game theory
Appears in Collections:Contributo in rivista

Files in This Item:
File Description SizeFormat 
3962.pdf
  Restricted Access
2,63 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.