文章基本信息

标题：Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
本地全文：下载
作者：Rahul Mathur ; Imran Khan ; Vikas Choudhary 等
期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2013
卷号：4
期号：3
页码：404-413
出版社：Technopark Publications
摘要：Many of the network topology design problems include CMST, which means to find a minimum cost tree that connects all the nodes of the network to the central node with some capacity constraint. The links of edges have associated costs that could be based on their distance, capacity, quality of line etc, and the nodes have their associated demand. Usually most of the network obtained from CMST are static in nature, but there are situations where the network is subjected to change by addition (or deletion) of nodes, such a network is known as dynamic network and identifying CMST in this case is known as Dynamic CMST or DCMST. EW algorithm is one of fundamental method to solve the DCMST problems, but it doesn’t always provide optimal solution. This thesis explores the Genetic Algorithm approach in finding better solution than EW Algorithm to DCMST problem
关键词：CMST; DCMST