PERBANDINGAN ALGORITMA KRUSKAL DENGAN ALGORITMA GENETIKA DALAM PENYELESAIAN MASALAH MINIMUM SPANNING TREE (MST)

Effendi, Rusdi and Diah, Puspitaningrum and Riska, Riska (2014) PERBANDINGAN ALGORITMA KRUSKAL DENGAN ALGORITMA GENETIKA DALAM PENYELESAIAN MASALAH MINIMUM SPANNING TREE (MST). In: Konferensi Nasional Teknologi Informasi dan Aplikasinya, 13 September 2014, Fakultas Ilmu Komputer Universitas Sriwijaya.

[img] Text (Prosiding)
B5 Proseding KNTIA 2014 Rusdi 01.pdf - Bibliography
Restricted to Registered users only
Available under License Creative Commons GNU GPL (Software).

Download (2MB)

Abstract

This research aims to develop a problem solving system of Minimum Spanning Tree using Kruskal Algorithm and Genetic Algorithm. The problem of Minimum Spanning Tree is how to calculate minimum distance in a complete graph where each nodes are connected and the selected edge should not make sircuit. This application system is built using Visual Basic 6.0 programming and MySQL database. The result of the whole process of this Minimum Spanning Tree aplication system is minimum distance which is calculated using Kruskal Algorithm and Gentic Algorithm. The displayed result are both text and visualization graph which show the minimum tree of a graph. Kruskal Algorithm generally shows better result than Genetic Algorithm with minimum distance resulted and running time as the parameters. For 5-25 nodes, Kruskal Algorithm generate minimum distance up to 50% and running time process 50 times faster than Genetic Algorithm.

Item Type: Conference or Workshop Item (Lecture)
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Engineering > Journal
Depositing User: 033 Darti Daryanti
Date Deposited: 11 Dec 2014 15:43
Last Modified: 11 Dec 2014 15:43
URI: http://repository.unib.ac.id/id/eprint/10039

Actions (login required)

View Item View Item