A Columnar Competitive Model for Solving Combinatorial Optimization Problems  

Oleh:

Tang, Huajin ; Tan, K. C. ; Yi, Zhang

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 15 no. 6 (Nov. 2004), page 1568-1574.
Topik: competitive analysis; columnar; competitive model; combinatorial; optimization problems

Ketersediaan

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

Lihat Detail Induk

Isi artikel

The major drawbacks of the Hopfield network when it is applied to some combinatorial problems, e. g., the traveling salesman problem (TSP), are invalidity of the obtained solutions, trial - and - error setting value process of the network parameters and low - computation efficiency. This letter presents a columnar competitive model (CCM) which incorporates winner - takes - all (WTA) learning rule for solving the TSP. Theoretical analysis for the convergence of the CCM shows that the competitive computational neural network guarantees the convergence to valid states and avoids the onerous procedures of determining the penalty parameters. In addition, its intrinsic competitive learning mechanism enables a fast and effective evolving of the network. The simulation results illustrate that the competitive model offers more and better valid solutions as compared to the original Hopfield network.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali