Eman Yousif Darwish, Mohammed Elsayed Wahed, Ahmed Salama
الملخص الانجليزي
in this paper I will present two different genetic and ant colony algorithms for solving a classic computer science problem: shortest path problems. I will first give a brief discussion on the general topics of the shortest path problem, genetic and ant colony algorithms. I will conclude by making some observations on the advantages and disadvantages of using genetic and ant colony algorithms to solve the shortest path problem and my opinion on the usefulness of the solutions and the future of this area of computer science .we present two different techniques for solving this problem. The first methods can be solved by using Fuzzy Optimization (FO) as routing protocol with network coding has been investigated and the performance for a proposed network in term of packet delay and throughput and bandwidth consumption has been presented. The second method is based on GA by using crossover , mutation and …
أ.د. أحمد سلامة | Prof. Dr. Ahmed Salama | 10538