Simulated Annealing Strategy in Chaotic Neural Network with Legendre Function

2021 ◽  
Author(s):  
Yaoqun Xu ◽  
Zhenhua Yang ◽  
Xinxin Zhen
Keyword(s):  
Neural Network ◽  
Simulated Annealing ◽  
Legendre Function ◽  
Chaotic Neural Network

SIMULATED ANNEALING SCHEMES IN TRANSIENTLY CHAOTIC NEURAL NETWORK MODEL

2004 ◽  
Vol 18 (17n19) ◽  
pp. 2579-2584 ◽  
Author(s):  
Y. C. FENG ◽  
X. CAI
Keyword(s):  
Neural Network ◽  
Simulated Annealing ◽  
Combinatorial Optimization ◽  
Neural Network Model ◽  
Approximation Method ◽  
Optimization Problems ◽  
Chaotic Neural Network ◽  
Combinatorial Optimization Problems ◽  
Search Speed ◽  
Evolution Function

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.

Sign in / Sign up

Export Citation Format

Share Document