Primal and dual neural networks for shortest-path routing

Presents two recurrent neural networks for solving the shortest path problem. Simplifying the architecture of a recurrent neural network based on the primal problem formulation, the first recurrent neural network called the primal routing network has less complex connectivity than its predecessor. Based on the dual problem formulation, the second recurrent neural network called the dual routing network has even simpler architecture. While being simple in architecture, the primal and dual routing networks are capable of shortest-path routing like their predecessor.

[1]  Jun Wang,et al.  Primal and dual assignment networks , 1997, IEEE Trans. Neural Networks.

[2]  P. Souéres,et al.  Shortest paths synthesis for a car-like robot , 1996, IEEE Trans. Autom. Control..

[3]  Su-Ling Lee,et al.  Neural networks for routing of communication networks with unreliable components , 1993, IEEE Trans. Neural Networks.

[4]  Jun Wang,et al.  A recurrent neural network for solving the shortest path problem , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[5]  John K. Antonio,et al.  A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks , 1992, IEEE Trans. Computers.

[6]  H.E. Rauch,et al.  Neural networks for routing communication traffic , 1988, IEEE Control Systems Magazine.

[7]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[8]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[9]  John J. Hopfield,et al.  Simple 'neural' optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit , 1986 .

[10]  Kang G. Shin,et al.  Shortest path planning in discretized workspaces using dominance relation , 1991, IEEE Trans. Robotics Autom..

[11]  Jun Wang.  Analysis and design of a recurrent neural network for linear programming , 1993 .

[12]  Anthony Ephremides,et al.  Control and optimization methods in communication network problems , 1989 .

[13]  Faouzi Kamoun,et al.  Neural networks for shortest path computation and routing in computer networks , 1993, IEEE Trans. Neural Networks.

[14]  Jun Wang,et al.  A deterministic annealing neural network for convex programming , 1994, Neural Networks.

[15]  Shyang Chang,et al.  A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes , 1993, IEEE Trans. Syst. Man Cybern..