dc.contributor.advisor | Nababan, Esther Sorta Mauli | |
dc.contributor.author | Marbun, Monika | |
dc.date.accessioned | 2024-09-12T04:43:54Z | |
dc.date.available | 2024-09-12T04:43:54Z | |
dc.date.issued | 2024 | |
dc.identifier.uri | https://repositori.usu.ac.id/handle/123456789/97231 | |
dc.description.abstract | Transportation problems are a special form of linear programming to handle the process of distributing goods from source (supply) to destination by minimizing transportation costs and distances, so strategic planning is needed to determine the route. Usually this problem is related to several parameters such as transportation costs, demand, and limited availability. This study uses the Vogel's Approximation (VAM) method to find an initial solution and applies the Stepping Stone method to test its optimality in balanced and unbalanced transportation problems. This study aims to show whether or not there is an effect on transportation costs if the location of supply and demand is varied. Based on the results of the study, it was found that variations in the location of supply and demand did not affect transportation costs. The transportation costs generated by applying the VAM method have reached the optimal solution. | en_US |
dc.language.iso | id | en_US |
dc.publisher | Universitas Sumatera Utara | en_US |
dc.subject | Transportation Cost | en_US |
dc.subject | Transportation Problems | en_US |
dc.subject | Stepping Stone Method | en_US |
dc.subject | Vogel’s Approximation Method (VAM) | en_US |
dc.subject | SDGs | en_US |
dc.title | Kajian Metode Vogel’s Approximation (VAM) dalam Optimisasi Masalah Transportasi dengan Variasi Posisi Supply dan Demand | en_US |
dc.title.alternative | Study of the Vogel’s Approximation Method (VAM) in Optimizing Transportation Problems with Varying Supply and Demand Position | en_US |
dc.type | Thesis | en_US |
dc.identifier.nim | NIM200803109 | |
dc.identifier.nidn | NIDN0018036102 | |
dc.identifier.kodeprodi | KODEPRODI44201#Matematika | |
dc.description.pages | 82 Pages | en_US |
dc.description.type | Skripsi Sarjana | en_US |