Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem

Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem

In Indonesia, the fund for a project or an activity is usually divided into terms which can be two or three terms. Therefore, in order to optimize the utility, the team of the project need to design the project so that the project can be used as soon as possible without violating the restriction giv...

Full description

Bibliographic Details
Main Authors: Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad
Format: Article
Language:English
Published: Asian Research Publishing Network (ARPN) 2015
Subjects:
QA Mathematics
Online Access:http://irep.iium.edu.my/46124/
http://irep.iium.edu.my/46124/
http://irep.iium.edu.my/46124/1/Wamiliana_ARPN_November_2015.pdf
id iium-46124
recordtype eprints
spelling iium-461242018-06-25T01:07:36Z http://irep.iium.edu.my/46124/ Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem Wamiliana, Wamiliana Elfaki, Faiz Ahmed Mohamed Usman, Mustofa Azram, Mohammad QA Mathematics In Indonesia, the fund for a project or an activity is usually divided into terms which can be two or three terms. Therefore, in order to optimize the utility, the team of the project need to design the project so that the project can be used as soon as possible without violating the restriction given by the government. The Multi Periods Degree Constrained Minimum Spanning Tree Problem (MPDCMST) is a problem that concerns about finding a minimum networks installations for a certain commodity so that the networks does not violate the reliability restriction whilst also satisfying the fund limitation in every stages of installations. In this paper we proposed three algorithms by modifying Kruskal’s and Prim’s algorithms. We implemented our algorithms on 300 generated problems with vertex order ranging from 10 to 100, and compared them with those that were already in the literature. The result shows that the algorithms proposed perform better. Asian Research Publishing Network (ARPN) 2015-11 Article PeerReviewed application/pdf en http://irep.iium.edu.my/46124/1/Wamiliana_ARPN_November_2015.pdf Wamiliana, Wamiliana and Elfaki, Faiz Ahmed Mohamed and Usman, Mustofa and Azram, Mohammad (2015) Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem. ARPN Journal of Engineering and Applied Sciences, 10 (21). pp. 10147-10152. ISSN 1819-6608 http://www.arpnjournals.org/jeas/research_papers/rp_2015/jeas_1115_3040.pdf
repository_type Digital Repository
institution_category Local University
institution International Islamic University Malaysia
building IIUM Repository
collection Online Access
language English
topic QA Mathematics
spellingShingle QA Mathematics
Wamiliana, Wamiliana
Elfaki, Faiz Ahmed Mohamed
Usman, Mustofa
Azram, Mohammad
Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
description In Indonesia, the fund for a project or an activity is usually divided into terms which can be two or three terms. Therefore, in order to optimize the utility, the team of the project need to design the project so that the project can be used as soon as possible without violating the restriction given by the government. The Multi Periods Degree Constrained Minimum Spanning Tree Problem (MPDCMST) is a problem that concerns about finding a minimum networks installations for a certain commodity so that the networks does not violate the reliability restriction whilst also satisfying the fund limitation in every stages of installations. In this paper we proposed three algorithms by modifying Kruskal’s and Prim’s algorithms. We implemented our algorithms on 300 generated problems with vertex order ranging from 10 to 100, and compared them with those that were already in the literature. The result shows that the algorithms proposed perform better.
format Article
author Wamiliana, Wamiliana
Elfaki, Faiz Ahmed Mohamed
Usman, Mustofa
Azram, Mohammad
author_facet Wamiliana, Wamiliana
Elfaki, Faiz Ahmed Mohamed
Usman, Mustofa
Azram, Mohammad
author_sort Wamiliana, Wamiliana
title Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
title_short Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
title_full Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
title_fullStr Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
title_full_unstemmed Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
title_sort some greedy based algorithms for multi periods degree constrained minimum spanning tree problem
publisher Asian Research Publishing Network (ARPN)
publishDate 2015
url http://irep.iium.edu.my/46124/
http://irep.iium.edu.my/46124/
http://irep.iium.edu.my/46124/1/Wamiliana_ARPN_November_2015.pdf
first_indexed 2023-09-18T21:05:40Z
last_indexed 2023-09-18T21:05:40Z
_version_ 1777410916197859328

Similar Items