Switched-current chaotic neural network with chaotic simulated annealing

This paper discusses capability of a switched-current chaotic neural network with chaotic simulated annealing to solve the traveling salesman problem (TSP). Numerical simulation results show that the network has good ability to search the global solution using chaotic dynamics, and to converge to it through the chaotic simulated annealing.