Abstract
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.
| Original language | English |
|---|---|
| Pages | 3146-3149 |
| Number of pages | 4 |
| Publication status | Published - 1995 Dec 1 |
| Externally published | Yes |
| Event | Proceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6) - Perth, Aust Duration: 1995 Nov 27 → 1995 Dec 1 |
Other
| Other | Proceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6) |
|---|---|
| City | Perth, Aust |
| Period | 95/11/27 → 95/12/1 |
ASJC Scopus subject areas
- Software