Primal and dual neural networks for shortest-path routing

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 28, Issue 6, 1998, Pages 864-869

  Wang, Jun ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Neural networks; Optimization; Shortest path problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

DUAL ROUTING NETWORK; PRIMAL ROUTING NETWORK; SHORTEST PATH PROBLEM;

RECURRENT NEURAL NETWORKS;

EID: 0032204839     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.725357     Document Type: Article

References (17)

1. L. Bodin, B. L. Golden, A. Assad, and M. Ball, "Routing and scheduling of vehicles and crews: The state of the art," Comput. Oper. Res., vol. 10, pp. 63-211, 1983.
2. A. Ephremides and S. Verdu, "Control and optimization methods in communication network problems," IEEE Trans. Automat. Contr., vol. 34, pp. 930-942, 1989.
3. J. K. Antonio, G. M. Huang, and W. K. Tsai, "A fast distributed shortest path algorithm for a class of hierarchically clustered data networks," IEEE Trans. Comput., vol. 41, pp. 710-724, 1992.
4. S. Jun and K. G. Shin, "Shortest path planning in distributed workspace using dominance relation," IEEE Trans. Robot. Automat., vol. 7, pp. 342-350, 1991.
5. P. L. Lin and S. Chang, "A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes," IEEE Trans. Syst., Man, Cybern., vol. 23, pp. 825-833, 1993.
6. P. Soueres and J.-P. Laumond, "Shortest paths synthesis for a car-like robot," IEEE Trans. Automat. Contr., vol. 41, pp. 672-688, 1996.
7. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart, and Winston, 1976, pp. 59-108.
8. J. J. Hopfield and D. W. Tank, "Neural computation of decisions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
9. D. W. Tank and J. J. Hopfield, "Simple neural optimization networks, an A/D converter, signal decision circuit, and a linear programming circuit," IEEE Trans. Circuits Syst., vol. CAS-33, pp. 533-541, 1986.
10. H. E. Rauch and T. Winarske, "Neural networks for routing communication traffic," IEEE Contr. Syst. Mag., vol. 8, pp. 26-30, 1988.
11. S.-L. Lee and S. Chang, "Neural networks for routing communication networks with unreliable components," IEEE Trans. Neural Networks, vol. 4, pp. 854-863, 1993.
12. M. Ali and F. Kamoun, "Neural networks for shortest path computation and routing in computer networks," IEEE Trans. Neural Networks, vol. 4, pp. 941-954, 1993.
13. J. Wang, "A recurrent neural network for solving the shortest path problem," IEEE Trans. Circuits Syst., vol. 43, pp. 482-486, 1996.
14. M. S. Bazaraa, J. J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows, 2nd ed. New York: Wiley, 1990.
15. J. Wang, "Analysis and design of a recurrent neural network for linear programming," IEEE Trans. Circuits Syst., vol. 40, pp. 613-618, 1993.
16. _, "A deterministic annealing neural network for convex programming," Neural Networks, vol. 7, pp. 629-641, 1994.
17. _, "Primal and dual assignment networks," IEEE Trans. Neural Networks, vol. 8, pp. 784-790, 1997.