Traveling-Salesman-Problem Algorithm Based on Simulated Annealing and Gene-Expression Programming
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 optimi...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-12-01
|
| Series: | Information |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2078-2489/10/1/7 |