Advertisement

Automation and Remote Control

, Volume 80, Issue 7, pp 1358–1367 | Cite as

Coalition-Formation Problem for Cooperative Inventory Routing Game

  • V. A. ShirokikhEmail author
  • E. A. LezhninaEmail author
Mathematical Game Theory and Applications

Abstract

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.

Keywords

inventory routing problem (IRPcooperative inventory-routing game (CIRGcharacteristic function heuristic algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Archetti, C., Bianchessi, N., Irnich, S., and Speranza, M.G., Formulations for an Inventory Routing Problem, Int. Transact. Operat. Res., 2014, vol. 21, no. 3, pp. 353–374.MathSciNetzbMATHGoogle Scholar
  3. 3.
    Aumann, R.J. and Dreze J.H., Cooperative Games with Coalition Structures, Int. J. Game Theory, 1974, vol. 3, no. 4, pp. 217–237MathSciNetzbMATHGoogle Scholar
  4. 4.
    Bellman, R., Dynamic Programming, Princeton: Princeton Univ. Press, 1957.zbMATHGoogle Scholar
  5. 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
  6. 6.
    Coelho, L.C., Cordeau, J.F., and Laporte, G., The Inventory-Routing Problem with Transshipment, Comput. Operat. Res., 2012, vol. 39, no. 11, pp. 2537–2548.MathSciNetzbMATHGoogle Scholar
  7. 7.
    Cordeau, J.F., Lagana, D., Musmanno, R., and Vocaturo, F., A Decomposition-Based Heuristic for the Multiple-Product Inventory-Routing Problem, Comput. Operat. Res., 2015, vol. 55, pp. 153–166.MathSciNetzbMATHGoogle Scholar
  8. 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. 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
  10. 10.
    Frisk, M., Gothe-Lundgren, M., Jornsten, K., and Ronnqvist, M., Cost Allocation in Collaborative Forest Transportation, Eur. J. Operat. Res., 2010, vol. 205, pp. 448–458.zbMATHGoogle Scholar
  11. 11.
    Guajardo, M. and Ronnqvist, M., A Review on Cost Allocation Methods in Collabora-Tive Transportation, Int. Transact. Operat. Res., 2016, vol. 23, no. 3, pp. 371–392.zbMATHGoogle Scholar
  12. 12.
    Jouida, J.B., Sihem, K., Krichen, S., and Klibi, W., Coalition-Formation Problem for Sourcing Contract Design in Supply Networks, Eur. J. Operat. Res., 2017, vol. 257, no. 2, pp. 539–558.MathSciNetzbMATHGoogle Scholar
  13. 13.
    Kimms, A. and Kozeletskyi, I., Core-Based Cost Allocation in the Cooperative Traveling Salesman Problem, Eur. J. Operat. Res., 2016, vol. 248, no. 3, pp. 910–916.MathSciNetzbMATHGoogle Scholar
  14. 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. 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. 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. 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
  18. 18.
    Zakharov, V.V. and Shchegryaev, A.N., Stable Cooperation in Dynamic Vehicle Routing Problems, Autom. Remote Control, 2015, vol. 76, no. 5, pp. 935–943.MathSciNetGoogle Scholar
  19. 19.
    Zakharov, V.V. and Shirokikh, V.A., Heuristic Evaluation of the Characteristic Function in the Cooperative Inventory Routing Game, J. Vehicle Rout. Algorithms, 2017.  https://doi.org/10.1007/s41604-017-0003-0 Google Scholar
  20. 20.
    http://www.leandro-coelho.com/instances/inventory-routing/

Copyright information

© Pleiades Publishing, Ltd. 2019

Authors and Affiliations

  1. 1.St. Petersburg State UniversitySt. PetersburgRussia

Personalised recommendations