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.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.