Authors: LungHsi Chen Jyhjeng Deng HsinShih Chen MingHua Chen
Publish Date: 2003/07/22
Volume: 22, Issue: 1-2, Pages: 1-11
Abstract
The main point of this paper is to provide a simple and efficient threshold value for the threshold accepting TA algorithm to attempt an optimal solution for the regular grid travelling salesman problems TSPs in a reliable way This new algorithm is named the single value threshold accepting algorithm SVTA The number of the threshold value is one and its value is leftlceil left 2 sqrt 2 rightg10000 rightrceil /10000 where g is the grid size and leftlceil x rightrceil is the smallest integer not less than a real number x For the regulargrid TSPs g can be set as 1/sqrt n where n is the problem size It is shown empirically with 100 independent simulations performed with 441 cities in 16 different cases that the SVTA is far superior to at least five times faster on average than the previous double threshold accepting DTA with respect to the speed of finding a global optimal reliably Particularly in the case of the 441 cities the proposed algorithm is at least 21 times faster and rises up to 96 times on average and optimistically 284 times faster than the previous one Important insight is provided that reveals how the formula works and why it works successfully
Keywords: