A node merging approach to the transhipment problem
Loading...
Date
2015
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Publishers
Abstract
In this paper, a new approach for solving transhipment model as a transportation model is developed and illustrated. The objective is to expose the transhipment problem to algorithms and methods that are transportation problem (TP) based. The principle of this method consists in merging source nodes with transhipment nodes, through utilization of all possible combination connections, transportation costs are summed up respectively. A numerical example is used to illustrate the approach. The least cost method (LCM) is used to solved the TP resulted from a transformed transhipment problem. Linear programming (LP) models are used as proof of correctness, thus we solve the original transhipment model as an LP problem. This study revealed that solutions from LCM are the same as that of LP formulated from the original transhipment model.
Description
Keywords
Node merging, Transportation, Transhipment, Shipping, Least cost method, Linear Programming
Citation
Tawanda, T. (2015). A node merging approach to the transhipment problem.