Managing transshipments in a multi-retailer system with approximate policies

Abstract

Using the right transshipment policy is important when transshipments are exercised under demand uncertainty. Optimal transshipment policy can be quite complex in a multi-firm system as optimal actions depend on all system variables. Moreover, both how to select requested retailer and how to respond to requests are in question. We introduce simple, close-to-optimal heuristic transshipment policies for multiple retailers. We first show that heuristic policies may perform even better than self-optimal policy, which is explained by Braess’s paradox. Then we test the performances of various heuristics with respect to centrally optimal policy. When retailers can observe others’ inventory levels, more effective transshipments can be made. Otherwise, a random selection performs quite well. We also observe that although always-accept respond policy is quite close to centrally optimal in small systems, the performance of pairwise-optimal holdback levels to respond requests is more clear and consistent for larger systems.

Keywords:

• inventory sharing
• decentralized system
• heuristic transshipment policy
• Braess’s paradox

Electronic supplementary material

The online version of this article (doi:10.1057/jors.2014.59) contains supplementary material, which is available to authorized users.

Supplementary Information accompanies this article on the Journal of the Operational Research Society website (www.palgrave-journals.com/jors)

Electronic supplementary material

The online version of this article (doi:10.1057/jors.2014.59) contains supplementary material, which is available to authorized users.

Supplementary Information accompanies this article on the Journal of the Operational Research Society website (www.palgrave-journals.com/jors)