TY  - JOUR
T1  - Network Design Problem Using Genetic Algorithm-an Empirical Study on Mutation Operator
AU - N. Jani, N. AU - Kumar, Anand 
JO  - International Journal of Soft Computing
VL  - 5
IS  - 4
SP  - 171
EP  - 176
PY  - 2010
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2010.171.176
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2010.171.176
KW  - mutation operator minimum spanning tree
KW  -network design
KW  -Genetic algorithm
KW  -performance
KW  -approch
KW  -constraints
AB  - This study presents an influence of mutation operator in genetic algorithm for small to large network design problem. A network design problem for this study falls under the network topology category which is a minimum spanning tree with various types of constraint which makes it NP-hard problem. Mutation operator plays an important role in genetic algorithm approach. Since many researchers have tried to solve this problem for small to mid size, we have explored the use of genetic algorithm with various mutation functions with modification but without changing the nature of genetic algorithm. Various mutation functions have been developed here as per the requirement of the problem and applied with the various size of network. In this study we have tried to show that how mutation functions affects the performance of genetic algorithm and also shown that GA is an alternative solution for this NP-hard problem.
ER  -