A discrete-time recurrent neural network for shortest-path routing

IEEE Transactions on Automatic Control

Volumn 45, Issue 11, 2000, Pages 2129-2134

  Xia, Youshen ^a   Wang, Jun ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Combinatorial optimization; Discrete time; Neural networks; Shortest path routing

Indexed keywords

ASYMPTOTIC STABILITY; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DISCRETE TIME CONTROL SYSTEMS; GLOBAL OPTIMIZATION; GRAPH THEORY; LINEAR PROGRAMMING; PARAMETER ESTIMATION; RECURRENT NEURAL NETWORKS; STEP RESPONSE; THEOREM PROVING;

COMBINATORIAL OPTIMIZATION; GLOBALLY CONVERGENT; SHORTEST PATH ROUTING; STEP PARAMETER; TRAFFIC ROUTING;

CONTROL SYSTEM ANALYSIS;

EID: 0034316660     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.887639     Document Type: Article

References (22)

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. 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.
4. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart, and Winston, 1976, pp. 59-108.
5. J. J. Hopfield and D. W. Tank, "Neural computation of decisions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
6. 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. 33, pp. 533-541, 1986.
7. A. Cichocki and R. Unbehauen, Neural Networks for Optimization and Signal Processing, London, U.K.: Wiley, 1993.
8. J. Wang, "A deterministic annealing neural network for convex programming," Neural Networks, vol. 7, pp. 629-641, 1994.
9. Y. Xia, "A new neural network for solving linear programming problems and its applications," IEEE Trans. Neural Networks, vol. 7, pp. 525-529, 1996.
10. _, "A new neural network for solving linear and quadratic programming problems," IEEE Trans. Neural Networks, vol. 7, pp. 1544-1547, 1996.
11. H. E. Rauch and T. Winarske, "Neural networks for routing communication traffic," IEEE Control Syst. Mag., vol. 8, pp. 26-30, 1988.
12. 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.
13. 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.
14. J. Wang, "A recurrent neural network for solving the shortest path problem," IEEE Trans. Circuits Syst. I, vol. 43, pp. 482-486, 1996.
15. _, "Primal-dual neural networks for solving the shortest path routing," IEEE Trans. Syst., Man, Cybern., vol. 28, pp. 854-859, 1998.
16. L. Zhang and S. C. A. Thomopoulos, "Neural network implementation of the shortest path algorithm for traffic routing in communication network," in Proc. Int. Joint Conf. Neural Networks, vol. II, Washington, D.C., June 18-22, 1989, p. 591.
17. S. C. A. Thomopoulos, L. Zhang, and C.-D. Wann, "Neural network implementation of the shortest path algorithm for traffic routing in communication network," in Proc. Int. Joint Conf. Neural Networks (IJCNN'91), Singapore, Nov 18-21, 1991, pp. 2693-2702.
18. D. T. Phillips and A. Garcia-Diaz, Fundamentals of Network Analysis. Englewood Cliffs, NJ: Prentice-Hall, 1981.
19. M. S. Bazaraa, J. J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows, 2nd ed. New York: Wiley, 1990.
20. X. Lu, "An approximate Newton method for linear programming," J. Numer. Comput. Appl., vol. 15, no. 2, pp. 93-104, 1994.
21. J. M. Ortega and W. G. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables. New York: Academic, 1970.
22. G. H. Golub and C. F. Loan, Matrix Computations, 3rd ed. Baltimore, MD: Johns Hopkins Univ. Press, 1996.