SIMULATED ANNEALING SCHEMES IN TRANSIENTLY CHAOTIC NEURAL NETWORK MODEL
2004 ◽
Vol 18
(17n19)
◽
pp. 2579-2584
◽
Keyword(s):
A transiently chaotic neural network (TCNN) is an approximation method for combinatorial optimization problems. The evolution function of self-back connect weight, called annealing function, influences the accurate and search speed of TCNN model. This paper analyzes two common annealing schemes. Furthermore we proposed a new subsection exponential annealing function. Finally, we compared these annealing schemes in TSP problem.
2004 ◽
Vol 34
(5)
◽
pp. 2119-2125
◽
1987 ◽
Vol 24
(03)
◽
pp. 657-667
◽