A study of the application of Kohonen-type neural networks to the travelling salesman problem (Q757268): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling the neural TSP algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organized formation of topologically correct feature maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organization and associative memory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the travelling salesman problem algorithm of Hopfield and Tank / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:10, 21 June 2024

scientific article
Language Label Description Also known as
English
A study of the application of Kohonen-type neural networks to the travelling salesman problem
scientific article

    Statements

    A study of the application of Kohonen-type neural networks to the travelling salesman problem (English)
    0 references
    0 references
    1991
    0 references
    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 using ``self-organization networks''. An algorithm is described in which general principles developed by \textit{T. Kohonen} [see: Self-organization and associative memory (1988; Zbl 0659.68100)] are applied to the Travelling Salesman Problem.
    0 references
    optimization
    0 references
    Travelling Salesman Problem
    0 references
    self-organization networks
    0 references
    algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references