Network Design Problem Using Genetic Algorithm-an Empirical Study on Mutation Operator
Anand Kumar, N. N. Jani · International Journal of Soft Computing · 2010
This paper presents an influence of selection function in genetic algorithm for network design problem. A network design problem for this paper falls under the network topology category which is a minimum spanning tree with various types of constraint which makes it NP-hard problem. Selection function plays an important key 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 selection functions with modification but without changing the nature of genetic algorithm. Various selection functions have been developed here as per the requirement of the problem and applied with the various size of network. Selection is not made only on the principle of “Survival of the fittest” rather it is developed according to the nature of problem. In this paper we have tried to show that how selection functions affects the performance of genetic algorithm and also shown that GA is an alternative solution for this NP-hard problem.