Far East Journal of Experimental and Theoretical Artificial Intelligence
Volume 2, Issue 2 (Special Issue on Hybrid Intelligent Systems), Pages 77 - 95
(November 2008)
|
|
A NEW APPROACH TO SOLVE THE TRAVELING SALESMAN PROBLEM
Wu-Hsien Shen (Taiwan) and Chwen-Tzeng Su (Taiwan)
|
Abstract:
During the past few years, most research done on traveling salesman problems (TSP) emphasize the use of meta-heuristics method combined with different mechanisms or controlling parameters to improve the solution quality and results. Very few studies investigate extensively on the nature of the topic in designing a more efficient mathematical calculation. Therefore, this study aims to examine the intrinsic qualities of the traveling salesman problems and applies the appropriate topic qualities to develop a set of efficient heuristic methods in performing the mathematical computations. This should provide a more effective means in solving the problem. Our research shall start off by conducting an enumerative approach in finding all solution spaces of a small-scale problem. In our analysis of and conclusion on solution space, it is discovered that the question of solution space has 3 distinct characteristics. Then based on the solution space properties of the problem, we develop a heuristic algorithm to calculate and solve the traveling salesman problem. Finally, the simulation experiment results prove that the method used in this research is better and more effective than other meta-heuristics. |
| Keywords and phrases: traveling salesman problem, meta-heuristics, heuristics algorithms. |
| Communicated by Zen-Jung Lee |
| Number of Downloads: 183 | Number of Views: 739 |
|
