Modified reactive tabu search for the symmetric traveling salesman problems
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 symm...
| Main Authors: | , , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 语言: | English |
| 出版: |
2013
|
| 主题: | |
| 在线阅读: | https://repo.uum.edu.my/id/eprint/19057/1/ICMSS%202013%20505-509.pdf |
| _version_ | 1825804135673364480 |
|---|---|
| author | Lim, Yai Fung Hong, Pei Yee Ramli, Razamin Khalid, Ruzelan |
| author_facet | Lim, Yai Fung Hong, Pei Yee Ramli, Razamin Khalid, Ruzelan |
| author_sort | Lim, Yai Fung |
| collection | UUM |
| description | 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. |
| first_indexed | 2024-07-04T06:09:24Z |
| format | Conference or Workshop Item |
| id | uum-19057 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:09:24Z |
| publishDate | 2013 |
| record_format | eprints |
| spelling | uum-190572016-12-07T02:12:41Z https://repo.uum.edu.my/id/eprint/19057/ Modified reactive tabu search for the symmetric traveling salesman problems Lim, Yai Fung Hong, Pei Yee Ramli, Razamin Khalid, Ruzelan QA75 Electronic computers. Computer science 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. 2013-02-05 Conference or Workshop Item PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/19057/1/ICMSS%202013%20505-509.pdf Lim, Yai Fung and Hong, Pei Yee and Ramli, Razamin and Khalid, Ruzelan (2013) Modified reactive tabu search for the symmetric traveling salesman problems. In: International Conference on Mathematical Sciences and Statistics (ICMSS2013), 5–7 February 2013, Kuala Lumpur, Malaysia. http://doi.org/10.1063/1.4823966 doi:10.1063/1.4823966 doi:10.1063/1.4823966 |
| spellingShingle | QA75 Electronic computers. Computer science Lim, Yai Fung Hong, Pei Yee Ramli, Razamin Khalid, Ruzelan Modified reactive tabu search for the symmetric traveling salesman problems |
| title | Modified reactive tabu search for the symmetric traveling salesman problems |
| title_full | Modified reactive tabu search for the symmetric traveling salesman problems |
| title_fullStr | Modified reactive tabu search for the symmetric traveling salesman problems |
| title_full_unstemmed | Modified reactive tabu search for the symmetric traveling salesman problems |
| title_short | Modified reactive tabu search for the symmetric traveling salesman problems |
| title_sort | modified reactive tabu search for the symmetric traveling salesman problems |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/19057/1/ICMSS%202013%20505-509.pdf |
| work_keys_str_mv | AT limyaifung modifiedreactivetabusearchforthesymmetrictravelingsalesmanproblems AT hongpeiyee modifiedreactivetabusearchforthesymmetrictravelingsalesmanproblems AT ramlirazamin modifiedreactivetabusearchforthesymmetrictravelingsalesmanproblems AT khalidruzelan modifiedreactivetabusearchforthesymmetrictravelingsalesmanproblems |