scholar.google.com › citations
To solve it, we can try to apply a modification of the Self-Organizing Map (SOM) technique. Let us take a look at what this technique consists, and then apply ...
An improved SOM neural network is proposed for the traveling salesman problem. The proposed SOM is firstly initialized by the nodes on the convex-full.
People also ask
What is the traveling salesman problem in self-organizing feature maps?
Which algorithm is used for travelling salesman problems?
What is a self-organizing map?
What is the travelling salesman problem using any optimization algorithm?
Nov 12, 2022 · This paper proposes an improved SOM network from the perspectives of network update strategy, initialization method, and parameter selection.
May 15, 2022 · In college we solved it with simulated annealing. Basically you have a parameter of energy (like the total distance travelled) that you want to minimise.
Abstract. In this paper, we propose novel adaptation rules for the self- organizing map to solve the prize-collecting traveling salesman problem. (PC-TSP).
Based on Kohonen's work on self-organizing feature maps, we derive an algorithm for solving the classical Travelling Salesman Problem.
Oct 17, 2022 · The Traveling Salesman Problem is a well known challenge in Computer Science: it consists on finding the shortest route possible that traverses all cities in a ...
Missing: Algorithm | Show results with:Algorithm
Dec 3, 2021 · Using an enhanced Self-Organizing Map method, we provided suboptimal solutions to the Traveling Salesman Problem.
Jun 6, 2017 · The travelling Salesman Problem (TSP) is an optimization problem. There are many algorithms that attempt to solve the TSP including ...
Jun 14, 2022 · The Traveling Salesman Problem is a well-known problem in Computer Science. In this article we share the source code which can solve it.