mailto:uumlib@uum.edu.my 24x7 Service; AnyTime; AnyWhere

An improved tabu search for solving symmetric traveling salesman problems

Lim, Yai Fung and Hong, Pei Yee and Ramli, Razamin and Khalid, Ruzelan (2011) An improved tabu search for solving symmetric traveling salesman problems. In: 2011 IEEE Colloquium on Humanities, Science and Engineering (CHUSER), 5-6 December 2011, Pulau Pinang.

[thumbnail of Yai-Fung_Lim,_Pei-Yee_Hong,_Razamin_&_Ruzelan.pdf] PDF
Restricted to Repository staff only

Download (81kB)

Abstract

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

Item Type: Conference or Workshop Item (Paper)
Additional Information: ISBN: 978-1-4673-0021-6
Uncontrolled Keywords: Traveling salesman problem; Tabu search; Simulated annealing; combinatorial optimization
Subjects: Q Science > QA Mathematics
Divisions: College of Arts and Sciences
Depositing User: Mdm. Yai Fung Lim
Date Deposited: 04 Jun 2012 01:35
Last Modified: 04 Jun 2012 01:35
URI: https://repo.uum.edu.my/id/eprint/5547

Actions (login required)

View Item View Item