A Neural Network for Shortest Path Computation  

Oleh:

Ribeiro, B. ; Rodrigues, L. ; Araujo, F.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 12 no. 5 (2001), page 1067-1073.
Topik: computational; neural network; shortest; path computation

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.5 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

This paper presents a new neural network to solve the shortest path problem for inter - network routing. The proposed solution extends the traditional single - layer recurrent Hopfield architecture introducing a two - layer architecture that automatically guarantees an entire set of constraints held by any valid solution to the shortest path problem. This new method addresses some of the limitations of previous solutions, in particular the lack of reliability in what concerns successful and valid convergence. Experimental results show that an improvement in successful convergence can be achieved in certain classes of graphs. Additionally, computation performance is also improved at the expense of slightly worse results.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali