Add to ORKGIn this paper, a definitce relation between the TSP's optimal solution and the attracting region in the parameters space of TSP's energy function is discovered. An many attracting region relating to the global optimal solution for TSP is founded. Then a neural network algorithm with the optimized parameters by using Orthogonal Array Table Method is proposed and used to solve the Travelling Salesman Problem (TSP) for 30, 31 and 300 cities and Map-coloring Problem (MCP). These results are very satisfactory.Computer Science, Hardware & ArchitectureComputer Science, Information SystemsEngineering, Electrical & ElectronicSCI(E)091520-1526E76
We present and analyze a Self Organizing Feature Map (SOFM) for the NP-complete problem of the trave...
In the orienteering problem, we are given a transportation network in which a start point and an end...
At present, a significant part of optimization problems, particularly questions of combinatorial opt...
A definite relation between the TSP (travelling salesman problem) optimal solution and the attractin...
In this paper,a definite relation between the TSP's optimal solution and the attracting region ...
This paper represents TSP (Travelling Salesman Problem) by using Artificial Neural Networks. A compa...
The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem...
Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2003Thesis (M.Sc.) -- ...
A novel modified method for obtaining approximate solutions to difficult optimization problems withi...
Easy to explain and difficult to solve, the traveling salesman problem, TSP, is to find the minimum ...
Abstract- Unsupervised learning applied to an unstructured neural network can give approximate solut...
“Neural approaches to solving the Travelling Salesman Problem (TSP) have used either the Hopfield ne...
This thesis discusses combinatorial optimization problems, its characteristics and solving methods. ...
This paper presents a comparative study of some Neural Networks methods and the newly-designed Afric...
Unsupervised learning applied to an unstructured neural network can give approximate solutions to th...
We present and analyze a Self Organizing Feature Map (SOFM) for the NP-complete problem of the trave...
In the orienteering problem, we are given a transportation network in which a start point and an end...
At present, a significant part of optimization problems, particularly questions of combinatorial opt...
A definite relation between the TSP (travelling salesman problem) optimal solution and the attractin...
In this paper,a definite relation between the TSP's optimal solution and the attracting region ...
This paper represents TSP (Travelling Salesman Problem) by using Artificial Neural Networks. A compa...
The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem...
Tez (Yüksek Lisans) -- İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2003Thesis (M.Sc.) -- ...
A novel modified method for obtaining approximate solutions to difficult optimization problems withi...
Easy to explain and difficult to solve, the traveling salesman problem, TSP, is to find the minimum ...
Abstract- Unsupervised learning applied to an unstructured neural network can give approximate solut...
“Neural approaches to solving the Travelling Salesman Problem (TSP) have used either the Hopfield ne...
This thesis discusses combinatorial optimization problems, its characteristics and solving methods. ...
This paper presents a comparative study of some Neural Networks methods and the newly-designed Afric...
Unsupervised learning applied to an unstructured neural network can give approximate solutions to th...
We present and analyze a Self Organizing Feature Map (SOFM) for the NP-complete problem of the trave...
In the orienteering problem, we are given a transportation network in which a start point and an end...
At present, a significant part of optimization problems, particularly questions of combinatorial opt...