It is observed that animals often have to resolve difficult tasks of optimization and that this process can be studied by applying the formal framework of neural networks to a simple problem such as the Travelling Salesman Problem. Existing work is reviewed with particular emphasis on recent studies
โฆ LIBER โฆ
Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
โ Scribed by J. C. Fort
- Publisher
- Springer-Verlag
- Year
- 1988
- Tongue
- English
- Weight
- 586 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0340-1200
No coin nor oath required. For personal study only.
โฆ Synopsis
We present an application of the Kohonen algorithm to the traveling salesman problem: Using only this algorithm, without energy function nor any parameter chosen "ad hoc", we found good suboptimal tours. We give a neural model version of this algorithm, closer to classical neural networks. This is illustrated with various numerical examples.
๐ SIMILAR VOLUMES
A study of the application of Kohonen-ty
โ
F. Favata; R. Walker
๐
Article
๐
1991
๐
Springer-Verlag
๐
English
โ 610 KB