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
-
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) -
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) -
Revisiting Traveling Salesman Problem (TSP): Analysis of GA and SA based Solutions
by: Darius Bethel, et al.
Published: (2021-06-01) -
A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
by: parham azimi, et al.
Published: (2014-09-01) -
An implementation of a branch-and-cut algorithm for the travelling salesman problem
by: Geldenhuys, Christel Erna
Published: (2012)