Coalition-Formation Problem for Cooperative Inventory Routing Game

This paper studies stability of carrier coalitions in a cooperative inventory routing game (CIRG). Difficulty of this study is not only in a computational complexity of the class of routing problems, but also in the task of constructing a characteristic function, since heuristic solutions that are usually used in routing problems can’t guarantee the subadditivity property in the general case. In its turn, violation of subadditivity can lead to...