Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Discrete Applied Mathematics - Special volume: viewpoints on optimization
A parallel tabu search algorithm for large traveling salesman problems
Discrete Applied Mathematics
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Adaptive Tabu Search and Applications in Engineering Design
Proceedings of the 2006 conference on Integrated Intelligent Systems for Engineering Design
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
| Hi-index | 0.00 |
The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics and combinatorial optimization. It is also considered as the class of the NP-complete combinatorial optimization problems. By literatures, many algorithms and approaches have been launched to solve such the TSP. However, no current algorithms that can provide the exactly optimal solution of the TSP problem are available. This paper proposes the application of AI search techniques to solve the TSP problems. Three AI search methods, i.e. genetic algorithms (GA), tabu search (TS), and adaptive tabu search (ATS), are conducted. They are tested against ten benchmark real-world TSP problems. As results compared with the exactly optimal solutions, the AI search techniques can provide very satisfactory solutions for all TSP problems.