CONCLUSION AND FUTURE WORKThe second objective of this thesis is to evaluate the performance of genetic algorithm used for finding the shortest path in communication network. The performance of GA is compared to Dijkstra algorithm in terms of finding the optimum solution and running time. This is realized using different simulated networks to clarify the advantages and deficiencies of each algorithm.