In most of network design problems, the minimum spanning tree (MST) is usually used as the backbone. If we add degree restriction on its vertices (can represent cities, stations, etc.) of the graph (represents the network), then the problem becomes the degree constrained minimum spanning tree (DCMST) problem. However, to do the installation or connecting the network, it is possible that the process must be done into some stages or periods. That situation occurs because of the weather constraint, fund constraint, etc. By restricting and dividing the stages or periods of the network’s installation, the problem emerges as the multiperiod degree constrained minimum spanning tree (MPDCMST) problem or multiperiod installation problem. We develop two algorithms based on modified Prim’s algorithms(WAC1 and WAC2) to solve the MPDCMST problem, and show and compare the different time installation effect on quality of the solutionby implementing and comparing those algorithms using 300 generate problems.

minimum spanning tree, degree constrained,installation, period.