A New Algorithm for the Shortest Paths Computation by Neural Networks on Time-dependent Networks
He Hong · Fudan xuebao. Ziran Kexue ban · 2004
Time-dependent networks are more practical or immediate significance compared with traditional networks models. There are instances to prove the famous Dijkstra's algorithm cannot be effectively used to solve the shortest path problems. A new kind of neural networks for continuously computing the shortest path on a time-dependent network is presented and the stability of the network is proved. This makes a new study on solving the optimization, but not NP-hard problems by neural networks.