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 instability of a coalition, because a player could get more profit in a different coalition or individually. To solve routing problems, Adaptive large neighborhood search (ALNS) and its modification with the Dynamic adaptation method, DALNS, are used in this work. A special Direct coalition induction algorithm (DCIA) is used to construct a subadditive characteristic function, and four different concepts of cooperative game solutions are considered. The analysis of extensive computational experiments allows to illustrate the dependence of the stability of a grand coalition on such factors as a routing algorithm, an algorithm for a characteristic function construction, and a solution concept for a cooperative game.
Keywordsinventory routing problem (IRP) cooperative inventory-routing game (CIRG) characteristic function heuristic algorithm
Unable to display preview. Download preview PDF.
- 1.Archetti, C., Bertazzi, L., Laporte, G., and Speranza, M.G., A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem, Transport. Sci., 2007, vol. 41, no. 3, pp. 382–391.Google Scholar
- 5.Coelho, L.C., Cordeau, J.F., and Laporte, G., Thirty Years of Inventory Routing, Transport. Sci., 2013, vol. 48, no. 1, pp. 1–19.Google Scholar
- 8.Desaulniers, G., Rakke, J.G., and Coelho, L.C., A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem, Transport. Sci., 2015, vol. 50, no. 3, pp. 1060–1076.Google Scholar
- 9.Driessen, T.S.H. and Tijs, S.H., The Cost Gap Method and Other Cost Allocation Methods for Multipurpose Water Projects, Water Resources Res., 1985, vol. 21, no. 10, pp. 1469–1475.Google Scholar
- 14.Krajewska, M.A., Kopfer, H., Laporte, G., Ropke, S., and Zaccour, G., Horizontal Cooperation among Freight Carriers: Request Allocation and Profit Sharing, J. Operat. Res. Soc., 2008, vol. 59, no. 11, pp. 1483–1491.Google Scholar
- 15.Ropke, S. and Pisinger, D., An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows, Transport. Sci., 2006, vol. 40, no. 4, pp. 455–472.Google Scholar
- 16.Verdonck, L., Caris, A.N., Ramaekers, K., and Janssens, G.K., Collaborative Logistics from the Perspective of Road Transportation Companies, Transport Rev., 2003, vol. 33, no. 6, pp. 700–719.Google Scholar
- 17.Zakharov, V. and Krylatov, A., Equilibrium Assignments in Competitive and Cooperative Traffic Flow Routing, IFIP Adv. Inform. Commun. Techn., Springer, 2014, vol. 434, pp. 641–648.Google Scholar