Heuristic genetic algorith with minimizing the whole network delay
Ma Cheng · Technology and Economy in Areas of Communications · 2005
The routing algorithms are employed in determining the proper routes along which the information packets input at a node of a computer network are transmitted so that the specified costs are minimum. A new routing algorithm is presented, by which the routes with the minimum total delays can be found out. In order to get an efficient and optimal solution, the heuristic genetic algorithm is used. The heuristic genetic algorithm decreases the routing sizes of the networks, with which a solution with the minimal total delay can be obtained gradually. Simulation results and analysis show the present algorithm requires less time complexity or better performance than those available.