Transshipment of Inventories: Dual Allocations vs. Transshipment Prices
Xiao Huang,
Greys So
i
Desautels Faculty of Management, McGill University, Montréal, Québec H3A 1G5, Canada
Marshall School of Business, University of Southern California, Los Angeles, California 90089
xiao.huang.2009{at}marshall.usc.edu
sosic{at}marshall.usc.edu
We study a newsvendor game with transshipments, in which n retailers face a stochastic demand for an identical product. Before the demand is realized, each retailer independently orders her initial inventory. After the demand is realized, the retailers select an optimal transshipment pattern and ship residual inventories to meet residual demands. Unsold inventories are salvaged at the end of the period. We compare two methods for distribution of residual profit—transshipment prices (TPs) and dual allocations (DAs)—that were previously analyzed in literature. TPs are selected before the demand is known, and DAs, which are obtained by calculating the dual prices for the transshipment problem, are calculated after observing the true demand. We first study the conditions for the existence of the Nash equilibria under DA and then compare the performance of the two methods and show that neither allocation method dominates the other. Our analysis suggests that DAs may yield higher efficiency among "more asymmetric" retailers, whereas TPs work better with retailers that are "more alike," but the difference in profits does not seem significant. We also link expected dual prices to TPs and use those results to develop heuristics for TPs with more than two symmetric retailers. For general instances with more than two asymmetric retailers, we propose a TP agreement that uses a neutral central depot to coordinate the transshipments (TPND). Although DAs in general outperform TPND in our numerical simulations, its ease of implementation makes TPND an attractive alternative to DAs when the efficiency losses are not significant (e.g., high critical fractiles or lower demand variances).
Key Words: inventory sharing; supply chain coordination; transshipment
History: Received: February 27, 2008;
accepted: May 18, 2009.
Copyright © 2009 by INFORMS.
