Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal Science and Technology Indonesia Jurnal Pengabdian UMKM
Taqwan Thamrin
Universitas Bandar Lampung
Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Environmental Science Languange, Linguistic, Communication & Media Materials Science & Nanotechnology Physics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Science and Technology Indonesia

 1 
The Use of Probability and Edge Analysis to Solve the Multi-Period Degree Constrained Minimum Spanning Tree Problem Wamiliana; Junaidi, Akmal; Gamal, Mohammad Danil Hendry; Thamrin, Taqwan
Science and Technology Indonesia Vol. 9 No. 4 (2024): October
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/sti.2024.9.4.999-1008

Abstract

The goal of the Multiperiod Degree Constrained Minimum Spanning Tree (MPDCMST) problem is to determine the smallest weight-spanning tree that satisfies the vertex installation criterion for each period and maintains the degree requirement in each vertex. This issue emerges as a network connection problem. The degree requirement indicates the reliability of each vertex, and the vertex connection/installation requirement denotes the priority vertices that must be inserted in the network within a specific time frame. The installation is split up into multiple phases/stages. This is because of various considerations such as severe weather, budgetary limitations, etc. In this research, two algorithms for solving the MPDCMST using probability hybridized with Prim’s modification, and edge analysis are proposed. The algorithms are implemented on the undirected complete graph of orders 10 to 100. The solutions are compared with some heuristics which are already in the literature. The results show that the proposed algorithms perform better.
Co-Authors Akmal Junaidi Ari Kurniawan Saputra Erlangga Erlangga Gamal, Mohammad Danil Hendry Muhammad Ardiansyah Tia Tanjung, Tia Wamiliana Wiwin Susanty