A self-organising model for the travelling salesman problem
DOI10.1057/PALGRAVE.JORS.2600439zbMATH Open0892.90148OpenAlexW1979824502MaRDI QIDQ4359924FDOQ4359924
Authors: Samerkae Somhom, Abdolhamid Modares, Takao Enkawa
Publication date: 20 October 1997
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600439
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)
Cited In (7)
- On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain
- Solving the traveling salesman problem using a recurrent neural network
- A minimum spanning tree based heuristic for the travelling salesman tour
- A study of the application of Kohonen-type neural networks to the travelling salesman problem
- An new self-organizing maps strategy for solving the traveling salesman problem
- Title not available (Why is that?)
- A neural-network-based approach to the double traveling salesman problem.
Uses Software
This page was built for publication: A self-organising model for the travelling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359924)