A new solution algoritm for the transportation model
Yükleniyor...
Dosyalar
Tarih
2009
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Selçuk Üniversitesi İktisadi ve İdari Bilimler Fakültesi
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In this article, we have theoretically tried to solve the transportation model with a new algorithm and compare it with the existing solution methods. The solution aim of the transportation model is to meet the total demand and total supply in order to minimize the total cost. For this purpose, the problem can be solved by three methods. These methods are: North-West Diagonal method, Least Cost Method and Vogel’s method. The order of these methods in terms of giving the most optimal initial solutions is Vogel approach, Least Cost and North-West Diagonal. With this new algorithm and proposed two rules; the solution of the problem is much more optimal than the existing ones in case of the same values in the same column or rows and alternative ones. For this purpose, two model problems were first solved by the new method and then by Least Cost and Vogel method (without North-West Diagonal method); and then the results were compared. It was found out that the new algorithm gave the most optimal and the most suitable initial solutions. When we are applying Rule1 and Rule2 with Vogel method we get better result. It means that, we get nearer optimal solution than normal Vogel method. This method gives better result then other used methods. We can propose as an alternative.
Açıklama
Anahtar Kelimeler
Transportation model, New algorithm, Optimal value, Vogel’s approximate, Ulaşım modeli, Yeni algoritma, Optimal değer, Vogel'in yaklaşık değeri
Kaynak
Selçuk Üniversitesi İktisadi ve İdari Bilimler Fakültesi Sosyal ve Ekonomik Araştırmalar Dergisi
WoS Q Değeri
Scopus Q Değeri
Cilt
8
Sayı
16
Künye
Patır, S. (2009). A new solution algoritm for the transportation model. Selçuk Üniversitesi İktisadi ve İdari Bilimler Fakültesi Sosyal ve Ekonomik Araştırmalar Dergisi, 8, (16), 267-282.
