%0 Journal Article
%T Efficient Heuristic Based Methods for Two-Stage Transshipment Problem
%A Priyank Sinha
%A Renduchintala Raghavendra Kumar Sharma
%J American Journal of Operations Research
%P 281-293
%@ 2160-8849
%D 2018
%I Scientific Research Publishing
%R 10.4236/ajor.2018.84016
%X In this article, we propose efficient methods for solving two stage transshipment
problems. Transshipment problem is the special case of Minimum cost
flow problem in which arc capacities are infinite. We start by proposing a
novel problem formulation for a two stage transshipment problem. Later, special
structure of our problem formulation is utilized to devise two dual based
heuristics solutions with computational complexity of O (n<sup>2</sup>), and O (n<sup>3</sup>) respectively.
These methods are motivated by the methods developed by Sharma
and Saxena [1], Sinha and Sharma [2]. Our methods differ in the initialization
and the subsequent variation of the dual variables associated with the transshipment
nodes along the shortest path. Lastly, a method is proposed to extract
a very good primal solution from the given dual solutions with a computational
complexity of O (n<sup>2</sup>). Efficacy of these methods is demonstrated by
our numerical analysis on 200 random problems.
%K Two Stage Transshipment Problem
%K Min Cost Flow
%K Transportation Problem
%K Dual
%K Primal
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=85789