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...
| Main Authors: | , , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 语言: | English |
| 出版: |
2011
|
| 主题: | |
| 在线阅读: | https://repo.uum.edu.my/id/eprint/5547/1/Yai-Fung_Lim%2C_Pei-Yee_Hong%2C_Razamin_%26_Ruzelan.pdf |