Modified reactive tabu search for the symmetric traveling salesman problems

• Main Authors: Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan
• Format: Conference or Workshop Item
• Language: English
• Published: 2013
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://repo.uum.edu.my/19057/1/ICMSS%202013%20505-509.pdf; http://repo.uum.edu.my/19057/; http://doi.org/10.1063/1.4823966

Reactive tabu search (RTS) is an improved method of tabu search (TS) and it dynamically adjusts tabu list size based on how the search is performed.RTS can avoid disadvantage of TS which is in the parameter tuning in tabu list size. In this paper, we proposed a modified RTS approach for solving symmetric traveling salesman problems (TSP).The tabu list size of the proposed algorithm depends on the number of iterations when the solutions do not override the aspiration level to achieve a good balance between diversification and intensification.The proposed algorithm was tested on seven chosen benchmarked problems of symmetric TSP.The performance of the proposed algorithm is compared with that of the TS by using empirical testing, benchmark solution and simple probabilistic analysis in order to validate the quality of solution. The computational results and comparisons show that the proposed algorithm provides a better quality solution than that of the TS.