A node merging approach to the transhipment problem
| dc.contributor.author | Tawanda, Trust | |
| dc.date.accessioned | 2016-11-23T08:10:52Z | |
| dc.date.accessioned | 2023-06-23T13:32:54Z | |
| dc.date.available | 2016-11-23T08:10:52Z | |
| dc.date.available | 2023-06-23T13:32:54Z | |
| dc.date.issued | 2015 | |
| dc.description.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. | en_US |
| dc.identifier.citation | Tawanda, T. (2015). A node merging approach to the transhipment problem. | en_US |
| dc.identifier.uri | http://196.220.97.103:4000/handle/123456789/726 | |
| dc.language.iso | en | en_US |
| dc.publisher | Springer Publishers | en_US |
| dc.subject | Node merging, Transportation, Transhipment, Shipping, Least cost method, Linear Programming | en_US |
| dc.title | A node merging approach to the transhipment problem | en_US |
| dc.type | Article | en_US |