Wamiliana, Wamiliana and Junaidi, Akmal and Amanto, Amanto and Usman, Mustofa and Warsono, Warsono (2020) WAC4 algorithm to solve the multiperiod degree constrained minimum spanning tree problem. Journal of Physics: Conference Series, 1524 (012046). pp. 1-5. ISSN Print : 1742-6588 Online : 1742-6596

Preview

Text Wamiliana_2020_J._Phys.__Conf._Ser._1524_012046.pdf Download (828kB) | Preview

Abstract

The Multiperiod Degree Constrained Minimum Spanning Tree (MPDCMST) is a problem of finding the smallest weight spanning tree while also maintaining the degree restriction in every vertex and satisfying the vertex installation requirement in every period. This problem arises in the networks installation problem where the degree restriction represents the reliability of each vertex and the vertex installation requirement represents the priority vertices that must be installed in the network on a certain period. The installation is divided into some periods because some conditions occur such as harsh weather, fund limitation, etc. In this paper, we propose a WAC4 Algorithm to solve the MPDCMST problem. The performance of the algorithm will be compared to the WAC1 algorithm already in the literature.

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

Actions (login required)

View Item