DocumentCode
3317970
Title
Chaotic neural networks and the traveling salesman problem
Author
Yamada, Taiji ; Aihara, Kazuyuki ; Kotani, Makoto
Author_Institution
Dept. of Electron. Eng., Tokyo Denki Univ., Japan
Volume
2
fYear
1993
fDate
25-29 Oct. 1993
Firstpage
1549
Abstract
Deterministic chaos is not only a profound scientific concept but also ubiquitously found in both natural and artificial real-world systems. From the viewpoint of engineering, the deterministic chaos has many possible applicabilities. In this report, the authors study the application of chaotic neural networks (CNN) to the traveling salesman problem (TSP) as a concrete example of possible application of deterministic chaos. First, a neuron model with chaotic dynamics, which comprises CNN as the element, is explained and its nonlinear dynamics are demonstrated. Second, the network representations for neurocomputing approaches to TSPs are described. Last, it is shown that CNN have high ability to solve TSPs.
Keywords
chaos; combinatorial mathematics; mathematics computing; neural nets; optimisation; chaotic neural networks; deterministic chaos; neurocomputing approaches; neuron model; nonlinear dynamics; traveling salesman problem; Artificial neural networks; Bifurcation; Biological neural networks; Biological system modeling; Cellular neural networks; Chaos; Neural networks; Neurons; Physics; Traveling salesman problems;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1993. IJCNN '93-Nagoya. Proceedings of 1993 International Joint Conference on
Print_ISBN
0-7803-1421-2
Type
conf
DOI
10.1109/IJCNN.1993.716882
Filename
716882
Link To Document