Research output: Contribution to journal › Article › peer-review
Coalition-Formation Problem for Cooperative Inventory Routing Game. / Shirokikh, V. A.; Lezhnina, E. A.
In: Automation and Remote Control, Vol. 80, No. 7, 01.07.2019, p. 1358-1367.Research output: Contribution to journal › Article › peer-review
}
TY - JOUR
T1 - Coalition-Formation Problem for Cooperative Inventory Routing Game
AU - Shirokikh, V. A.
AU - Lezhnina, E. A.
PY - 2019/7/1
Y1 - 2019/7/1
N2 - 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.
AB - 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.
KW - characteristic function
KW - cooperative inventory-routing game (CIRG)
KW - heuristic algorithm
KW - inventory routing problem (IRP)
UR - http://www.scopus.com/inward/record.url?scp=85068843879&partnerID=8YFLogxK
UR - http://www.mendeley.com/research/coalitionformation-problem-cooperative-inventory-routing-game
U2 - 10.1134/S0005117919070129
DO - 10.1134/S0005117919070129
M3 - статья
VL - 80
SP - 1358
EP - 1367
JO - Automation and Remote Control
JF - Automation and Remote Control
SN - 0005-1179
IS - 7
ER -
ID: 45663326