APLIKASI ALGORITMA BELLMAN – FORD DALAM MEMINIMUMKAN BIAYA OPERASIONAL RUTE PENERBANGAN

BOWO KRISTANTO, NIM. 08610014 (2012) APLIKASI ALGORITMA BELLMAN – FORD DALAM MEMINIMUMKAN BIAYA OPERASIONAL RUTE PENERBANGAN. Skripsi thesis, UIN SUNAN KALIJAGA.

[img]
Preview
Text (APLIKASI ALGORITMA BELLMAN – FORD DALAM MEMINIMUMKAN BIAYA OPERASIONAL RUTE PENERBANGAN )
BAB I, IV, DAFTAR PUSTAKA.pdf

Download (490kB) | Preview
[img] Text (APLIKASI ALGORITMA BELLMAN – FORD DALAM MEMINIMUMKAN BIAYA OPERASIONAL RUTE PENERBANGAN )
BAB II, III.pdf
Restricted to Repository staff only

Download (2MB)

Abstract

This thesis discusses the concepts, mechanisms, and application of Bellman – Ford. In its application Bellman Ford algorithm is used to determine flight routes in order to minimize operating costs. The purpose of this study was to determine the routes obtained in order to minimum operating costs. Some theoritical framework used are operations research, graph theory, Bellman - Ford. Algorithm methods used in this study is to find the problem, formulating the problem, data retrieval, analysis and problem solving, making conclusions. Based on the results of this study, Bellman – Ford algorithm may be used to solve the problem in which there exists the negative weight (cost), and can be applied in the real world, such as flight routes. Keywords: Algorithm Bellman - Ford. Flight Routes.

Item Type: Thesis (Skripsi)
Subjects: Matematika
Divisions: Fakultas Sains dan Teknologi > Matematika (S1)
Depositing User: Miftahul Ulum [IT Staff]
Date Deposited: 30 May 2013 17:19
Last Modified: 12 Jan 2016 15:34
URI: http://digilib.uin-suka.ac.id/id/eprint/7943

Share this knowledge with your friends :

Actions (login required)

View Item View Item
Chat Kak Imum