Strong coalitional structure in a transportation game

This paper introduces an extension of the vehicle routing problem by including several decision makers in competition. Each customer is characterized by demand and distance to the warehouse. The problem is described as an open vehicle routing game (CTG). We consider customers to be players in the game. Their strategies are the routes for a track they should rent to deliver goods subject to their demand with minimal transportation costs under assumption, that transportation costs are allocated between players according to Nash arbitrage scheme. For each profile in coalitional strategies it is provided a coalitional structure of players and costs of each player.
We provide a computable procedure to calculate strong equilibrium. It also calculates a numerical example.