Shortest path routing algorithm based on chaotic neural network

摘要

A shortest path routing algorithm based on transient chaotic neural network is proposed in this paper. Compared with previous models adopting Hopfield neural network, this algorithm has a higher ability to overcome the local minimum, and achieves a better performance. By introducing a special post-processing technique for the output matrixes, our algorithm can obtain an optimal solution with a high probability even for the paths that need more hops in large-sizenetworks.