• Login
    View Item 
    •   USU-IR Home
    • Faculty of Mathematics and Natural Sciences
    • Department of Mathematics
    • Undergraduate Theses
    • View Item
    •   USU-IR Home
    • Faculty of Mathematics and Natural Sciences
    • Department of Mathematics
    • Undergraduate Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Kajian Masalah Transshipment Tidak Seimbang Menggunakan Metode Least Cost - Stepping Stone dan Metode Least Cost - Modi

    Thumbnail
    View/Open
    Fulltext (2.161Mb)
    Date
    2016
    Author
    Sari, Putri Winda
    Advisor(s)
    Rosmaini, Elly
    Metadata
    Show full item record
    Abstract
    Transshipment problem is the development of the transportation problem where to send a commodity from a source to a destination cannot be done directly but through an agent or a transit first. Same as the transportation problem, the purpose of solving the transshipment problem is getting distribution costs to a minimum. This study discusses resolve the issue of transshipment with the unbalanced condition which amount of supply is not equal to the amount of demand, the method that used to solve this problem is the Least Cost method to search the initial solution and the Stepping Stone method for optimal completion. Least Cost - MODI method was also used to compare the optimality test which one is better for use in solving the problem of transshipment. Results from the study concludes that the Least Cost - Stepping Stone method and Least Cost - MODI method can solve the problem of transshipment is not balanced, but according to the turns ratio test MODI method is more efficient than the method used in the Stepping Stone to test the optimality of a transshipment problem. The surplus of MODI method is the number of iterations are fewer and repair searchable index without having to find a loop of each cell is empty, it only takes one loop obtained after determining the cell with the largest improvement index. While the weakness of Stepping Stone method is in the search index value improvement of each cell is empty, Stepping Stone method should seek the nearest loop for all the empty cells on iteration. In this research, known that Least Cost method will give different transportation costs if the position of placement fees was changed. While the Stepping Stone method will give the same and optimal transportation costs if position of placement costs was changed.
    URI
    https://repositori.usu.ac.id/handle/123456789/79942
    Collections
    • Undergraduate Theses [1471]

    Repositori Institusi Universitas Sumatera Utara - 2025

    Universitas Sumatera Utara

    Perpustakaan

    Resource Guide

    Katalog Perpustakaan

    Journal Elektronik Berlangganan

    Buku Elektronik Berlangganan

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of USU-IRCommunities & CollectionsBy Issue DateTitlesAuthorsAdvisorsKeywordsTypesBy Submit DateThis CollectionBy Issue DateTitlesAuthorsAdvisorsKeywordsTypesBy Submit Date

    My Account

    LoginRegister

    Repositori Institusi Universitas Sumatera Utara - 2025

    Universitas Sumatera Utara

    Perpustakaan

    Resource Guide

    Katalog Perpustakaan

    Journal Elektronik Berlangganan

    Buku Elektronik Berlangganan

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV