An new self-organizing maps strategy for solving the traveling salesman problem
From MaRDI portal
Publication:2497623
DOI10.1016/j.chaos.2005.08.114zbMath1129.90045OpenAlexW2157025561MaRDI QIDQ2497623
Wendong Zhang, Zhen Jin, Yanping Bai
Publication date: 4 August 2006
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2005.08.114
Related Items
Genetic operators for combinatorial optimization in TSP and microarray gene ordering ⋮ On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain ⋮ A new algorithm for finding the shortest paths using PCNNs
Cites Work
- A study of the application of Kohonen-type neural networks to the travelling salesman problem
- ``Neural computation of decisions in optimization problems
- Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
- The Guilty net for the traveling salesman problem
- The Euclidean traveling salesman problem is NP-complete
- Competition-based neural network for the multiple travelling salesmen problem with minmax objective
- Self-organizing maps.
