Hopfield-genetic approach for solving the routing problem in computer networks
Md Ikhwan Hamdan, M.E. El-Hawary · 2003
This paper presents a method that combines Hopfield networks (HN) and a genetic algorithm (GA) to solve the problem of optimal routing in computer networks. Hopfield neural networks perform fast and efficient local searches and guarantee convergence to feasible solutions, but they are inefficient for global search. On the other hand, genetic algorithms are powerful in global search, but they take long computation time to solve large-scale problem. To overcome these limitations, a combined approach is proposed where a solution produced by a Hopfield network is incorporated in the initial population of the GA. The proposed method is verified through simulation and it shows an improvement in the quality of the solution and reduces the computation time.