A node merging approach to the transhipment problem
| Autor: | Trust Tawanda |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
050210 logistics & transportation
Mathematical optimization Correctness Linear programming Strategy and Management Node (networking) 05 social sciences 02 engineering and technology Transportation theory 0502 economics and business Least cost 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Safety Risk Reliability and Quality Algorithm Mathematics |
| Zdroj: | International Journal of System Assurance Engineering and Management. 8:370-378 |
| ISSN: | 0976-4348 0975-6809 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink