Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem
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....
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | en en en |
| Published: |
International Islamic University Malaysia
2020
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/87928/1/87928_USING%20MODIFICATION%20OF%20PRIM%E2%80%99S_article.pdf http://irep.iium.edu.my/87928/2/87928_USING%20MODIFICATION%20OF%20PRIM%E2%80%99S_scopus.pdf http://irep.iium.edu.my/87928/13/87928_Using%20modification%20of%20Prim%27s%20algorithm_WoS.pdf http://irep.iium.edu.my/87928/ https://journals.iium.edu.my/ejournal/index.php/iiumej/article/view/1088/728 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 like
Unix 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. |
|---|