A new method of improving Wang and Smith's chaotic neural network

In this paper, a novel method is proposed, with the aid of which the change of time step, /spl Delta/t, depends on two parameters according to the value of the cost function of combinatorial optimization problems. We have applied Wang and Smith's (1998) method and the proposed method to 10 city traveling salesman problem (TSP), respectively. The simulation results show that the performance of the proposed method is better than that of Wang and Smith's chaotic neural networks.