scholarly journals A Self-Organizing Neural Network for the Traveling Salesman Problem That Is Competitive with Simulated Annealing

1996 ◽  
Vol 8 (2) ◽  
pp. 416-424 ◽  
Author(s):  
Marco Budinich
Keyword(s):  
Neural Network ◽  
Simulated Annealing ◽  
Unsupervised Learning ◽  
Traveling Salesman Problem ◽  
Approximate Solutions ◽  
Elastic Net ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem ◽  
Better Than ◽  
Self Organizing

Unsupervised learning applied to an unstructured neural network can give approximate solutions to the traveling salesman problem. For 50 cities in the plane this algorithm performs like the elastic net of Durbin and Willshaw (1987) and it improves when increasing the number of cities to get better than simulated annealing for problems with more than 500 cities. In all the tests this algorithm requires a fraction of the time taken by simulated annealing.

LEARNING TO COOPERATE IN SOLVING THE TRAVELING SALESMAN PROBLEM

2005 ◽  
Vol 15 (01n02) ◽  
pp. 151-162 ◽  
Author(s):  
DEHU QI ◽  
RON SUN
Keyword(s):  
Reinforcement Learning ◽  
Traveling Salesman Problem ◽  
Single Agent ◽  
Traveling Salesman ◽  
Cooperative Team ◽  
The Traveling Salesman Problem ◽  
Better Than

A cooperative team of agents may perform many tasks better than single agents. The question is how cooperation among self-interested agents should be achieved. It is important that, while we encourage cooperation among agents in a team, we maintain autonomy of individual agents as much as possible, so as to maintain flexibility and generality. This paper presents an approach based on bidding utilizing reinforcement values acquired through reinforcement learning. We tested and analyzed this approach and demonstrated that a team indeed performed better than the best single agent as well as the average of single agents.

scholarly journals Traveling-Salesman-Problem Algorithm Based on Simulated Annealing and Gene-Expression Programming

Information ◽  
2018 ◽  
Vol 10 (1) ◽  
pp. 7 ◽  
Author(s):  
Ai-Hua Zhou ◽  
Li-Peng Zhu ◽  
Bin Hu ◽  
Song Deng ◽  
Yan Song ◽  
...  
Keyword(s):  
Gene Expression ◽  
Simulated Annealing ◽  
Traveling Salesman Problem ◽  
Heuristic Algorithms ◽  
Gene Expression Programming ◽  
Optimal Solution ◽  
Traveling Salesman ◽  
Np Hard Problem ◽  
Convergence Performance ◽  
The Traveling Salesman Problem

The traveling-salesman problem can be regarded as an NP-hard problem. To better solve the best solution, many heuristic algorithms, such as simulated annealing, ant-colony optimization, tabu search, and genetic algorithm, were used. However, these algorithms either are easy to fall into local optimization or have low or poor convergence performance. This paper proposes a new algorithm based on simulated annealing and gene-expression programming to better solve the problem. In the algorithm, we use simulated annealing to increase the diversity of the Gene Expression Programming (GEP) population and improve the ability of global search. The comparative experiments results, using six benchmark instances, show that the proposed algorithm outperforms other well-known heuristic algorithms in terms of the best solution, the worst solution, the running time of the algorithm, the rate of difference between the best solution and the known optimal solution, and the convergent speed of algorithms.

Sign in / Sign up

Export Citation Format

Share Document