论文部分内容阅读
The shortest path (SP) problem is a classical combinatorial optimization problem which plays an important role in a packet-switched computer and communication network.A new primal-dual neural network to solve the shortest path problem (PDSPN) is presented in this paper. The proposed neural network combines many features such as no network coefficients set,easy implementation in a VLSI circuit, and is proved to be completely stable to the exact solutions. The simulation example shows its efficiency in finding the “optimum” path(s) for data transmission in computer and communication network. ;;;
The shortest path (SP) problem is a classical combinatorial optimization problem which plays an important role in a packet-switched computer and communication network. A new primal-dual neural network to solve the shortest path problem (PDSPN) is presented in this paper. The proposed neural network combines many features such as no network coefficients set, easy implementation in a VLSI circuit, and is proved to be completely stable to the exact solutions. The simulation example shows its efficiency in finding the “optimum ” path (s ) for data transmission in computer and communication network. ;;;