Match!

Coalition-Formation Problem for Cooperative Inventory Routing Game

Published on Jul 1, 2019in Automation and Remote Control0.59
· DOI :10.1134/S0005117919070129
V. A. Shirokikh (SPbU: Saint Petersburg State University), E. A. Lezhnina (SPbU: Saint Petersburg State University)
Cite
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.
  • References (19)
  • Citations (0)
Cite
References19
Newest
Published on Mar 1, 2018
Victor V. Zakharov5
Estimated H-index: 5
(SPbU: Saint Petersburg State University),
Viacheslav A. Shirokikh1
Estimated H-index: 1
(SPbU: Saint Petersburg State University)
This paper is concerned with the problem of the characteristic function evaluation for the game theory model of horizontal cooperation of carriers on large transportation networks. We consider a mathematical formalization of the Cooperative Inventory Routing Game (CIRG) in the form of characteristic function. Due to non-exact evaluation of the minimal cost for the coalitions, we have the subadditivity property of the characteristic function to be not fulfilled in general case. To calculate the v...
Published on Mar 1, 2017in European Journal of Operational Research3.81
Sihem Ben Jouida1
Estimated H-index: 1
(Institut Supérieur de Gestion),
Saoussen Krichen8
Estimated H-index: 8
(Institut Supérieur de Gestion),
Walid Klibi8
Estimated H-index: 8
(KEDGE Business School)
This article studies a coalition-formation problem for cooperative replenishment with a single supplier and multiple firms. We consider that a vertical cooperation between the supplier and the set of firms is already set, using periodic individual contracts, and we investigate the profitability of a horizontal cooperation between firms when designing collaborative contracts. Given the significant savings that can be realized thanks to horizontal collaboration, the main interest of the potential ...
Mario Guajardo11
Estimated H-index: 11
(NHH: Norwegian School of Economics),
RönnqvistMikael32
Estimated H-index: 32
(Laval University)
Collaboration in transportation between two or more agents is becoming an important approach to find efficient solutions or plans. Efficiency can be measured in, for example, lower cost or more flexibility. An important aspect of the collaboration is to decide on how to share the benefits—for example, cost, profit, or resources. There are many sharing mechanisms or cost allocations proposed in the literature. Some are based on simple proportional rules and others are based on theoretical concept...
Published on Feb 1, 2016in European Journal of Operational Research3.81
Alf Kimms23
Estimated H-index: 23
(University of Duisburg-Essen),
Igor Kozeletskyi2
Estimated H-index: 2
(University of Duisburg-Essen)
This paper presents a cost allocation scheme for a horizontal cooperation of traveling salesmen that is implemented a priori and provides expected costs for the coalition members. The cost allocation is determined using the core concept. To compute the value of the characteristic function over the whole planning horizon the TSP with release dates combined with simulation is used. The developed core computation algorithm, based on mathematical programming techniques, provides a core element or, i...
Published on May 1, 2015in Automation and Remote Control0.59
Victor V. Zakharov5
Estimated H-index: 5
(SPbU: Saint Petersburg State University),
Alexander N. Shchegryaev1
Estimated H-index: 1
(SPbU: Saint Petersburg State University)
This paper explores transportation cost minimization in the vehicle routing problem under carriers' cooperation on large-scale transport networks. The underlying model is a dynamic cooperative game with transferable utility (TU) functions. We propose a heuristic iterative algorithm for constructing the subadditive characteristic function of the corresponding static game. The algorithm is modified in order to construct the characteristic function of the dynamic routing game. The Shapley value and...
Published on Mar 1, 2015in Computers & Operations Research3.00
Jean-François Cordeau52
Estimated H-index: 52
(HEC Montréal),
Demetrio Laganà11
Estimated H-index: 11
(University of Calabria)
+ 1 AuthorsFrancesca Vocaturo7
Estimated H-index: 7
(University of Calabria)
Abstract The inventory-routing problem is an integrated logistics planning problem arising in situations where customers transfer the responsibility for inventory replenishment to the vendor. The vendor must then decide when to visit each customer, how much to deliver and how to sequence customers in vehicle routes. In this paper, we focus on the case where several different products have to be delivered by a fleet of vehicles over a finite and discrete planning horizon. We present a three-phase...
Published on Oct 6, 2014 in PRO-VE (Working Conference on Virtual Enterprises)
Victor V. Zakharov5
Estimated H-index: 5
(SPbU: Saint Petersburg State University),
Alexander Y. Krylatov4
Estimated H-index: 4
(SPbU: Saint Petersburg State University)
The goal of the paper is to demonstrate possibilities of collaborative transportation network to minimize total travel time of the network users. Cooperative and competitive traffic flow assignment systems in case of m ≥2 navigation providers (Navigators) are compared. Each Navigator provides travel guidance for its customers (users) on the non-general topology network of parallel links. In both cases the main goals of Navigators are to minimize travel time of their users but the behavioral stra...
Claudia Archetti27
Estimated H-index: 27
(University of Brescia),
Nicola Bianchessi11
Estimated H-index: 11
(University of Brescia)
+ 1 AuthorsMaria Grazia Speranza41
Estimated H-index: 41
(University of Brescia)
In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benc...
Published on Feb 1, 2014in Transportation Science3.31
Leandro C. Coelho14
Estimated H-index: 14
,
Jean-François Cordeau52
Estimated H-index: 52
,
Gilbert Laporte101
Estimated H-index: 101
The inventory-routing problem (IRP) dates back 30 years. It can be described as the combination of vehicle-routing and inventory management problems, in which a supplier has to deliver products to a number of geographically dispersed customers, subject to side constraints. It provides integrated logistics solutions by simultaneously optimizing inventory management, vehicle routing, and delivery scheduling. Some exact algorithms and several powerful metaheuristic and matheuristic approaches have ...
Published on Nov 1, 2013in Transport Reviews6.65
Lotte Verdonck1
Estimated H-index: 1
(Research Foundation - Flanders),
An Caris17
Estimated H-index: 17
(Research Foundation - Flanders)
+ 1 AuthorsGerrit K. Janssens17
Estimated H-index: 17
(University of Hasselt)
To survive under the ever increasing competitive and global pressures to operate more efficiently, transportation companies are obliged to adopt a collaborative focus. Various types of cooperative supply chain relationships have been discussed in both professional and academic literature over the last decades. However, research on horizontal cooperation in logistics remains scarce and scattered across various research domains. Companies operating at the same level of the supply chain and perform...
Cited By0
Newest