SIMULATED ANNEALING SCHEMES IN TRANSIENTLY CHAOTIC NEURAL NETWORK MODEL.

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. [ABSTRACT FROM AUTHOR]