An improved tabu search for solving symmetric traveling salesman problems
Tabu search (TS) is a heuristic for provinding excellent solutions to hard combinatorial problems. However, the quality of solution of TS depends on the intial solution. In this paper, we proposed and improved TS approach for solving symmetric traveling salesman problems (TSP). The proposed algorith...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/5547/1/Yai-Fung_Lim%2C_Pei-Yee_Hong%2C_Razamin_%26_Ruzelan.pdf http://repo.uum.edu.my/5547/ http://dx.doi.org/10.1109/CHUSER.2011.6163857 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Utara Malaysia |
| Language: | English |
| Summary: | Tabu search (TS) is a heuristic for provinding excellent solutions to hard combinatorial problems. However, the quality of solution of TS depends on the intial solution. In this paper, we proposed and improved TS approach for solving symmetric traveling salesman problems (TSP). The proposed algorithm is an integration of two heuristic approaches which are TS and simulated annealing (SA). The algorithm was tested on five chosen benchmarked problems of symmetric TSP. the prformance of the proposed algorithm is compared with that of the conventional TS algorithm in order to validate the quality of solutions. Computational results and comparisons show that the proposed algorithm has better performance than that of the conventional TS |
|---|