Please use this identifier to cite or link to this item:
|Title:||A columnar competitive model for solving combinatorial optimization problems||Authors:||Tang, H.
Traveling salesman problem (TSP)
|Issue Date:||Nov-2004||Citation:||Tang, H., Tan, K.C., Yi, Z. (2004-11). A columnar competitive model for solving combinatorial optimization problems. IEEE Transactions on Neural Networks 15 (6) : 1568-1573. ScholarBank@NUS Repository. https://doi.org/10.1109/TNN.2004.836244||Abstract:||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. © 2004 IEEE.||Source Title:||IEEE Transactions on Neural Networks||URI:||http://scholarbank.nus.edu.sg/handle/10635/53952||ISSN:||10459227||DOI:||10.1109/TNN.2004.836244|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.