Wamiliana, Wamiliana and Usman, Mustofa and Warsono, Warsono and Warsito, Warsito and Daoud, Jamal I (2020) USING MODIFICATION OF PRIM’S ALGORITHM AND GNU OCTAVE AND TO SOLVE THE MULTIPERIODS INSTALLATION PROBLEM. IIUM Engineering Journal, 21 (1). pp. 100-112. ISSN 2289 -7860

[img] Text

Download (428kB)


ABSTRACT: The Minimum Spanning Tree (MST) is one of the famous problems that is used mostly as the backbone in many network design problems. Given a graph G(V,E), where V is the set of vertices and E is the set of edges connecting vertices in V, and for every edge eij there is an associated weight cij ≥0. The Multi Period Degree Constrained Minimum Spanning Tree (MPDCMST) is a problem of finding an MST while also considering the degree constrained on every vertex, and satisfying vertices installation requirement on every period. Two algorithms (WWM1 and WWM2) are proposed for solving this problem. GNU OCTAVE is used for coding and visualization. GNU is a recursive acronym for "GNU's Not Unix!", and that name is chosen because it is likeUnix but differs from Unix because it is free and contains no Unix code. Those algorithms were implemented using 300 randomly generated problems. Moreover, we compare WWM1 and WWM2 algorithms using existing data from the literature and the results show that WWM2 is the best.

Item Type: Article
Subjects: Q Science > QA Mathematics
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika
Depositing User: WAMILIANA
Date Deposited: 20 Feb 2020 09:02
Last Modified: 20 Feb 2020 09:02
URI: http://repository.lppm.unila.ac.id/id/eprint/18152

Actions (login required)

View Item View Item