Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem (Q1101043)

From MaRDI portal
Revision as of 10:31, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
scientific article

    Statements

    Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem (English)
    0 references
    1988
    0 references
    We present an application of the \textit{T. Kohonen} algorithm [ibid. 43, 59-69 (1982; Zbl 0466.92002)] to the traveling salesman problem: using only this algorithm, without energy function nor any parameter choosen ``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.
    0 references
    self-organizing process
    0 references
    traveling salesman problem
    0 references
    suboptimal tours
    0 references
    neural model
    0 references
    neural networks
    0 references
    numerical examples
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references