An Evolutionary Approach to Solve Network Route Optimization Problem

Optimized network saves the cost of the network as well as it is faster in the terms of data delivery. In wired network, optimization is directly related to the cost and speed of the network while in wireless network it reflects to reliability and performance. An Optimized network can be represented in the form of constrained spanning tree where the term constrained is represented by different parameters like degree, cost, speed, reliability and fault tolerance etc. Degree Constraint Minimum Spanning Tree is special class of constrained spanning tree where degree of the node represents the connectivity of the node with other nodes. This DCMST problem belongs to the category of NP-hard problem and so far no optimal solution has been developed to find it. This project work has developed an approach using Genetic Algorithm. Genetic Algorithm is a class of evolutionary algorithm which works on the principle of "Survival of the fittest". Parallel solutions are developed in genetic algorithm which is further selected and genetic operators are applied followed by fitness function. Solutions are improved from generation to generation and reaches to the stage of optimal solution.

Autorentext

Anand Kumar poluchil stepen' magistra nauk w Banarasskom induistskom uniwersitete i rabotaet nad doktorskoj dissertaciej w kachestwe assistenta prepodawatelq w shkole biohimicheskoj inzhenerii Indijskogo tehnologicheskogo instituta (BHU), Varanasi, Indiq. Rabotal w kachestwe priglashennogo prepodawatelq w kolledzhe Barejli (Uniwersitet M. Dzh. P. R.) Barejli. Rabotal nad izucheniem sal'monell.