UMM Institutional Repository

OPTIMALISASI BIAYA JALUR TRAVEL DENGAN MENGGUNAKAN ALGORITMA DJIKSTRA DAN MAX-FLOW-MIN-CUT

KHOLIDIAH, NURUL (2014) OPTIMALISASI BIAYA JALUR TRAVEL DENGAN MENGGUNAKAN ALGORITMA DJIKSTRA DAN MAX-FLOW-MIN-CUT. Other thesis, University of Muhammadiyah Malang.

Full text not available from this repository.

Abstract

Many factors will be consideration in setting up into travel business, including: a travel route from origin city to destination city, distances that will be pursued, transport fleet to be used, office operating costs, all of these factors will have an impact on the rates to be determined. Considerations aim to optimize a travel path cost to obtain a low cost. By using max-flow-min-cut will be find the maximum cost flow, and used Djikstra algorithm to find the shortest path. This study aims to determine the application of max-flow-min-cut in determining the maximum cost of fuel needed to travel a path. In addition, to determine the application of Djikstra algorithm in finding the shortest route based on distance between cities of a travel lane. The shortest distance is used as the study was a travel point-Bojonegoro Surabaya, Surabaya and Surabaya-Ngawi-Pacitan. Costs are discussed in this study is the cost of fuel needed to track vehicles travel above. By using Djikstra algorithm obtained shortest distance of Surabaya-Bojonegoro is 108 km and the minimal cost based this distance is 48.600, and the maximum number of flows in that network transport travel lane 31.050. Then the minimal cost is greater than the current maximum. For the Surabaya-Ngawi Shortest distance is 177 km and the minimal cost flow based this distance is 79.650, and the maximum number of flows in that network transport travel lane Surabaya-Ngawi is 31.050. Then the minimal cost is greater than the current maximum. As for the shortest distance of Surabaya-Pacitan is 203 km and the minimal cost based this distance is 112.850, and the maximum number of flows in that network is 27.450. So the number of minimal cost in the shortest travel path Surabaya-Bojonegoro, Surabaya-Ngawi, Surabaya-Pacitan greater than the current maximum fee amount.

Item Type: Thesis (Other)
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Teacher Training and Education > Department of Mathematics and Computing
Depositing User: Gusti Vani Putri Cahya
Date Deposited: 06 Feb 2015 07:36
Last Modified: 06 Feb 2015 07:36
URI : http://eprints.umm.ac.id/id/eprint/15800

Actions (login required)

View Item View Item
UMM Official

© 2008 UMM Library. All Rights Reserved.
Jl. Raya Tlogomas No 246 Malang East Java Indonesia - Phone +62341464318 ext. 150, 151 - Fax +62341464101
E-Mail : infopus[at]umm.ac.id - Website : http://lib.umm.ac.id - Online Catalog : http://laser.umm.ac.id - Repository : http://eprints.umm.ac.id

Web Analytics

UMM Institutional Repository is powered by :
EPrints Logo