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: | Ai-Hua Zhou, Li-Peng Zhu, Bin Hu, Song Deng, Yan Song, Hongbin Qiu, Sen Pan |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-12-01
|
Series: | Information |
Subjects: | |
Online Access: | http://www.mdpi.com/2078-2489/10/1/7 |
Similar Items
-
The simulated annealing technique for travelling salesman problem /
by: 527263 Subashini Vilu, et al.
Published: (2012) -
The simulated annealing technique for travelling salesman problem [electronic resource] /
by: 527263 Subashini Vilu
Published: (2012) -
Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic
by: Vincent F. Yu, et al.
Published: (2023-10-01) -
Improved Genetic and Simulating Annealing Algorithms to Solve the Traveling Salesman Problem Using Constraint Programming
by: M. Abdul-Niby, et al.
Published: (2016-04-01) -
An analysis of several heuristics for the traveling salesman problems /
by: 428771 Rosenkrants, Daniel J., et al.