A Self-Organising Neural Network for the Travelling Salesman Problem that is Competitive with Simulated Annealing

ICANN ’94 ◽  
1994 ◽  
pp. 358-361 ◽  
Author(s):  
Marco Budinich
Keyword(s):  
Neural Network ◽  
Simulated Annealing ◽  
Travelling Salesman Problem ◽  
Travelling Salesman

Neural Network Algorithm for Solving Large Scale Travelling Salesman Problems

2012 ◽  
Vol 542-543 ◽  
pp. 1398-1402
Author(s):  
Guo Zhong Cheng ◽  
Wei Feng ◽  
Fang Song Cui ◽  
Shi Lu Zhang
Keyword(s):  
Neural Network ◽  
Time Complexity ◽  
Large Scale ◽  
Travelling Salesman Problem ◽  
Effective Algorithm ◽  
Travelling Salesman ◽  
Satisfactory Solution ◽  
Network Algorithm ◽  
The Neural Network ◽  
Neural Network Algorithm

This study improves the neural network algorithm that was presented by J.J.Hopfield for solving TSP(travelling salesman problem) and gets an effective algorithm whose time complexity is O(n*n), so we can solve quickly TSP more than 500 cities in microcomputer. The paper considers the algorithm based on the replacement function of the V Value. The improved algorithm can greatly reduces the time and space complexities of Hopfield method. The TSP examples show that the proposed algorithm could efficiently find a satisfactory solution and has a fast convergence speed.

scholarly journals SHORTEST PATH DETERMINATION BETWEEN EDUCATIONAL INSTITUTIONS OF RĒZEKNE MUNICIPALITY

2017 ◽  
Vol 3 ◽  
pp. 451
Author(s):  
Pēteris Grabusts ◽  
Jurijs Musatovs
Keyword(s):  
Simulated Annealing ◽  
Degrees Of Freedom ◽  
Travelling Salesman Problem ◽  
Optimization Method ◽  
Educational Institutions ◽  
Travelling Salesman ◽  
Simulated Annealing Method ◽  
Multiple Degrees Of Freedom ◽  
Combinatorial System ◽  
Annealing Method

This study describes an optimization method called Simulated Annealing. The Simulated Annealing method is widely used in various combinatorial optimization tasks. Simulated Annealing is a stochastic optimization method that can be used to minimize the specified cost function given a combinatorial system with multiple degrees of freedom. In this study the application of the Simulated Annealing method to a well - known task of combinatorial analysis, Travelling Salesman Problem, is demonstrated and an experiment aimed to find the shortest tour distances between educational institutions of Rēzekne Municipality is performed. It gives possibilities to analyze and search optimal schools' network in Rēzekne Municipality.

Sign in / Sign up

Export Citation Format

Share Document