Coalition-formation problem for cooperative inventory routing game
Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 10 (2018) no. 1, pp. 99-115

Voir la notice de l'article provenant de la source Math-Net.Ru

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 ($IRP$), cooperative inventory-routing game ($CIRG$), characteristic function
Mots-clés : heuristic algorithm.
@article{MGTA_2018_10_1_a5,
     author = {Viacheslav A. Shirokikh and Elena A. Lezhnina},
     title = {Coalition-formation problem for cooperative inventory routing game},
     journal = {Matemati\v{c}eska\^a teori\^a igr i e\"e prilo\v{z}eni\^a},
     pages = {99--115},
     publisher = {mathdoc},
     volume = {10},
     number = {1},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MGTA_2018_10_1_a5/}
}
TY  - JOUR
AU  - Viacheslav A. Shirokikh
AU  - Elena A. Lezhnina
TI  - Coalition-formation problem for cooperative inventory routing game
JO  - Matematičeskaâ teoriâ igr i eë priloženiâ
PY  - 2018
SP  - 99
EP  - 115
VL  - 10
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MGTA_2018_10_1_a5/
LA  - ru
ID  - MGTA_2018_10_1_a5
ER  - 
%0 Journal Article
%A Viacheslav A. Shirokikh
%A Elena A. Lezhnina
%T Coalition-formation problem for cooperative inventory routing game
%J Matematičeskaâ teoriâ igr i eë priloženiâ
%D 2018
%P 99-115
%V 10
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MGTA_2018_10_1_a5/
%G ru
%F MGTA_2018_10_1_a5
Viacheslav A. Shirokikh; Elena A. Lezhnina. Coalition-formation problem for cooperative inventory routing game. Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 10 (2018) no. 1, pp. 99-115. http://geodesic.mathdoc.fr/item/MGTA_2018_10_1_a5/